Computational Complexity Characterization of Protecting Elections from Bribery (English)
- New search for: Chen, Lin
- New search for: Sunny, Ahmed
- New search for: Xu, Lei
- New search for: Xu, Shouhuai
- New search for: Gao, Zhimin
- New search for: Lu, Yang
- New search for: Shi, Weidong
- New search for: Shah, Nolan
- New search for: Chen, Lin
- New search for: Sunny, Ahmed
- New search for: Xu, Lei
- New search for: Xu, Shouhuai
- New search for: Gao, Zhimin
- New search for: Lu, Yang
- New search for: Shi, Weidong
- New search for: Shah, Nolan
In:
Computing and combinatorics
; 85-97
;
2020
-
ISBN:
- Conference paper / Print
-
Title:Computational Complexity Characterization of Protecting Elections from Bribery
-
Contributors:Chen, Lin ( author ) / Sunny, Ahmed ( author ) / Xu, Lei ( author ) / Xu, Shouhuai ( author ) / Gao, Zhimin ( author ) / Lu, Yang ( author ) / Shi, Weidong ( author ) / Shah, Nolan ( author )
-
Conference:COCOON ; 26. ; 2020 ; Online
-
Published in:Computing and combinatorics ; 85-97
-
Publisher:
- New search for: Springer
-
Place of publication:Cham
-
Publication date:2020
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
- New search for: 54.10
- Further information on Basic classification
-
Keywords:
-
Classification:
BKL: 54.10 Theoretische Informatik -
Source:
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Subspace Approximation with OutliersDeshpande, Amit / Pratap, Rameshwar et al. | 2020
- 14
-
Linear-Time Algorithms for Eliminating Claws in GraphsBonomo-Braberman, Flavia / Nascimento, Julliano R. / Oliveira, Fabiano S. / Souza, Uéverton S. / Szwarcfiter, Jayme L. et al. | 2020
- 27
-
A New Lower Bound for the Eternal Vertex Cover Number of GraphsBabu, Jasine / Prabhakaran, Veena et al. | 2020
- 40
-
Bounded-Degree Spanners in the Presence of Polygonal ObstaclesRenssen, André van / Wong, Gladys et al. | 2020
- 52
-
End-Vertices of AT-free BigraphsGorzny, Jan / Huang, Jing et al. | 2020
- 64
-
Approaching Optimal Duplicate Detection in a Sliding WindowGéraud-Stewart, Rémi / Lombard-Platet, Marius / Naccache, David et al. | 2020
- 85
-
Computational Complexity Characterization of Protecting Elections from BriberyChen, Lin / Sunny, Ahmed / Xu, Lei / Xu, Shouhuai / Gao, Zhimin / Lu, Yang / Shi, Weidong / Shah, Nolan et al. | 2020
- 98
-
Coding with Noiseless Feedback over the Z-ChannelDeppe, Christian / Lebedev, Vladimir / Maringer, Georg / Polyanskii, Nikita et al. | 2020
- 110
-
Path-Monotonic Upward Drawings of GraphsHong, Seok-Hee / Nagamochi, Hiroshi et al. | 2020
- 123
-
Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road NetworksFunke, Stefan et al. | 2020
- 136
-
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in PlaneAgrawal, Sanjana / Inkulu, R. et al. | 2020
- 149
-
How Hard Is Completeness Reasoning for Conjunctive Queries?Liu, Xianmin / Li, Jianzhong / Li, Yingshu et al. | 2020
- 162
-
Imbalance Parameterized by Twin Cover RevisitedMisra, Neeldhara / Mittal, Harshil et al. | 2020
- 174
-
Local Routing in a Tree Metric 1-SpannerBrankovic, Milutin / Gudmundsson, Joachim / Renssen, André van et al. | 2020
- 186
-
Deep Specification Mining with AttentionCao, Zhi / Zhang, Nan et al. | 2020
- 198
-
Constructing Independent Spanning Trees in Alternating Group NetworksHuang, Jie-Fu / Hsieh, Sun-Yuan et al. | 2020
- 210
-
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton DimensionBlum, Johannes et al. | 2020
- 222
-
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the PlaneEades, Patrick / Mestre, Julián et al. | 2020
- 234
-
Quantum Speedup for the Minimum Steiner Tree ProblemMiyamoto, Masayuki / Iwamura, Masakazu / Kise, Koichi / Gall, François Le et al. | 2020
- 246
-
Access Structure Hiding Secret Sharing from Novel Set Systems and Vector FamiliesSehrawat, D. Vipin Singh / Desmedt, Yvo et al. | 2020
- 262
-
Approximation Algorithms for Car-Sharing ProblemsLuo, Kelin / Spieksma, Frits C. R. et al. | 2020
- 274
-
Realization Problems on Reachability SequencesDippel, Matthew / Sundaram, Ravi / Varma, Akshar et al. | 2020
- 287
-
Power of Decision Trees with Monotone QueriesAmireddy, Prashanth / Jayasurya, Sai / Sarma, Jayalal et al. | 2020
- 299
-
Computing a Maximum Clique in Geometric Superclasses of Disk GraphsGrelier, Nicolas et al. | 2020
- 311
-
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone VisibilityNilsson, Bengt J. / Orden, David / Palios, Leonidas / Seara, Carlos / Żyliński, Pawel et al. | 2020
- 324
-
Tight Approximation for the Minimum Bottleneck Generalized Matching ProblemMestre, Julián / Moses, Nicolás E. Stier et al. | 2020
- 335
-
Graph Classes and Approximabihty of the Happy Set ProblemAsahiro, Yuichi / Eto, Hiroshi / Hanaka, Tesshu / Lin, Guohui / Miyano, Eiji / Terabaru, Ippei et al. | 2020
- 347
-
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning SubgraphsBeyer, Stephan / Chimani, Markus / Spoerhase, Joachim et al. | 2020
- 360
-
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix GamesGutin, Gregory / Neary, Philip R. / Yeo, Anders et al. | 2020
- 372
-
On the Enumeration of Minimal Non-pairwise Compatibility GraphsAzam, Naveed Ahmed / Shurbevski, Aleksandar / Nagamochi, Hiroshi et al. | 2020
- 384
-
Constructing Tree Decompositions of Graphs with Bounded GonalityBodlaender, Hans L. / Bruyn, Josse van Dobben de / Gijswijt, Dion / Smit, Harry et al. | 2020
- 397
-
Election Control Through Social Influence with Unknown PreferencesMehrizi, Mohammad Abouei / Corò, Federico / Cruciani, Emilio et al. | 2020
- 411
-
k-Critical Graphs in Ps-Free GraphsCameron, Kathie / Goedgebeur, Jan / Huang, Shenwei / Shi, Yongtang et al. | 2020
- 423
-
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing ProblemSalem, Khadija Hadj / Kieffer, Yann et al. | 2020
- 435
-
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar GraphsLozzo, Giordano Da / D'Angelo, Anthony / Frati, Fabrizio et al. | 2020
- 448
-
On the Restricted 1-Steiner Tree ProblemBose, Prosenjit / D’Angelo, Anthony / Durocher, Stephane et al. | 2020
- 460
-
Computational Complexity of Synchronization Under Regular Commutative ConstraintsHoffmann, Stefan et al. | 2020
- 472
-
Approximation Algorithms for General Cluster Routing ProblemZhang, Xiaoyan / Du, Donglei / Gutin, Gregory / Ming, Qiaoxia / Sun, Jian et al. | 2020
- 484
-
Hardness of Sparse Sets and Minimal Circuit Size ProblemFu, Bin et al. | 2020
- 496
-
Succinct Monotone Circuit Certification: Planarity and Parameterized ComplexityAlves, Mateus Rodrigues / Oliveira, Mateus de Oliveira / Silva, Janio Carlos Nascimento / Souza, Uéverton dos Santos et al. | 2020
- 508
-
On Measures of Space over Real and Complex NumbersPrakash, Om / Rao, B. V. Raghavendra et al. | 2020
- 520
-
Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality ConstraintZhang, Hongxiang / Xu, Dachuan / Guo, Longkun / Tan, Jingjing et al. | 2020
- 532
-
An Improved Bregman k-means++ Algorithm via Local SearchTian, Xiaoyun / Xu, Dachuan / Guo, Longkun / Wu, Dan et al. | 2020
- 542
-
Approximating Maximum Acyclic Matchings by Greedy and Local Search StrategiesBaste, Julien / Fürst, Maximilian / Rautenbach, Dieter et al. | 2020
- 554
-
On the Complexity of Directed Intersection Representation of DAGsCaucchiolo, Andrea / Cicalese, Ferdinando et al. | 2020
- 566
-
On the Mystery of Negations in Circuits: Structure vs PowerAmireddy, Prashanth / Jayasurya, Sai / Sarma, Jayalal et al. | 2020
- 578
-
Even Better Fixed-Parameter Algorithms for Bicluster EditingLafond, Manuel et al. | 2020
- 591
-
Approximate Set Union via Approximate RandomizationFu, Bin / Gu, Pengfei / Zhao, Yuming et al. | 2020
- 603
-
A Non-Extendibility Certificate for Submodularity and ApplicationsBhaskar, Umang / Kumar, Gunjan et al. | 2020
- 615
-
Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPHAgrawal, Akanksha / Kundu, Madhumita / Sahu, Abhishek / Saurabh, Saket / Tale, Prafullkumar et al. | 2020
- 627
-
Approximation Algorithms for the Lower-Bounded k-Median and Its GeneralizationsHan, Lu / Hao, Chunlin / Wu, Chenchen / Zhang, Zhenning et al. | 2020
- 640
-
A Survey for Conditional Diagnosability of Alternating Group NetworksChang, Nai-Wen / Hsieh, Sun-Yuan et al. | 2020
- 652
-
Fixed Parameter Tractability of Graph Deletion Problems over Data StreamsBishnu, Arijit / Ghosh, Arijit / Kolay, Sudeshna / Mishra, Gopinath / Saurabh, Saket et al. | 2020
- 664
-
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded SeparatorsBezáková, Ivona / Sun, Wenbo et al. | 2020