default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th COCOON 2020: Atlanta, GA, USA
- Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee:
Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Lecture Notes in Computer Science 12273, Springer 2020, ISBN 978-3-030-58149-7 - Amit Deshpande, Rameshwar Pratap
:
Subspace Approximation with Outliers. 1-13 - Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-Time Algorithms for Eliminating Claws in Graphs. 14-26 - Jasine Babu, Veena Prabhakaran:
A New Lower Bound for the Eternal Vertex Cover Number of Graphs. 27-39 - André van Renssen, Gladys Wong:
Bounded-Degree Spanners in the Presence of Polygonal Obstacles. 40-51 - Jan Gorzny, Jing Huang:
End-Vertices of AT-free Bigraphs. 52-63 - Rémi Géraud-Stewart, Marius Lombard-Platet, David Naccache:
Approaching Optimal Duplicate Detection in a Sliding Window. 64-84 - Lin Chen, Ahmed Sunny, Lei Xu, Shouhuai Xu, Zhimin Gao, Yang Lu, Weidong Shi, Nolan Shah:
Computational Complexity Characterization of Protecting Elections from Bribery. 85-97 - Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding with Noiseless Feedback over the Z-Channel. 98-109 - Seok-Hee Hong, Hiroshi Nagamochi:
Path-Monotonic Upward Drawings of Graphs. 110-122 - Stefan Funke:
Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks. 123-135 - Sanjana Agrawal, R. Inkulu:
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane. 136-148 - Xianmin Liu, Jianzhong Li, Yingshu Li:
How Hard Is Completeness Reasoning for Conjunctive Queries? 149-161 - Neeldhara Misra, Harshil Mittal:
Imbalance Parameterized by Twin Cover Revisited. 162-173 - Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local Routing in a Tree Metric 1-Spanner. 174-185 - Zhi Cao, Nan Zhang:
Deep Specification Mining with Attention. 186-197 - Jie-Fu Huang, Sun-Yuan Hsieh:
Constructing Independent Spanning Trees in Alternating Group Networks. 198-209 - Johannes Blum:
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension. 210-221 - Patrick Eades, Julián Mestre:
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. 222-233 - Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall:
Quantum Speedup for the Minimum Steiner Tree Problem. 234-245 - Vipin Singh Sehrawat, Yvo Desmedt:
Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families. 246-261 - Kelin Luo, Frits C. R. Spieksma:
Approximation Algorithms for Car-Sharing Problems. 262-273 - Matthew Dippel, Ravi Sundaram, Akshar Varma:
Realization Problems on Reachability Sequences. 274-286 - Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
Power of Decision Trees with Monotone Queries. 287-298 - Nicolas Grelier:
Computing a Maximum Clique in Geometric Superclasses of Disk Graphs. 299-310 - Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. 311-323 - Julián Mestre, Nicolás E. Stier Moses:
Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. 324-334 - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Graph Classes and Approximability of the Happy Set Problem. 335-346 - Stephan Beyer, Markus Chimani, Joachim Spoerhase:
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. 347-359 - Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. 360-371 - Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. 372-383 - Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing Tree Decompositions of Graphs with Bounded Gonality. 384-396 - Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo:
Election Control Through Social Influence with Unknown Preferences. 397-410 - Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi:
k-Critical Graphs in P5-Free Graphs. 411-422 - Khadija Hadj Salem, Yann Kieffer:
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem. 423-434 - Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs. 435-447 - Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted 1-Steiner Tree Problem. 448-459 - Stefan Hoffmann:
Computational Complexity of Synchronization Under Regular Commutative Constraints. 460-471 - Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun:
Approximation Algorithms for General Cluster Routing Problem. 472-483 - Bin Fu:
Hardness of Sparse Sets and Minimal Circuit Size Problem. 484-495 - Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. 496-507 - Om Prakash, B. V. Raghavendra Rao:
On Measures of Space over Real and Complex Numbers. 508-519 - Hongxiang Zhang, Dachuan Xu, Longkun Guo, Jingjing Tan:
Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint. 520-531 - Xiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu:
An Improved Bregman k-means++ Algorithm via Local Search. 532-541 - Julien Baste, Maximilian Fürst, Dieter Rautenbach:
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. 542-553 - Andrea Caucchiolo, Ferdinando Cicalese:
On the Complexity of Directed Intersection Representation of DAGs. 554-565 - Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
On the Mystery of Negations in Circuits: Structure vs Power. 566-577 - Manuel Lafond:
Even Better Fixed-Parameter Algorithms for Bicluster Editing. 578-590 - Bin Fu, Pengfei Gu, Yuming Zhao:
Approximate Set Union via Approximate Randomization. 591-602 - Umang Bhaskar, Gunjan Kumar:
A Non-Extendibility Certificate for Submodularity and Applications. 603-614 - Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. 615-626 - Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang:
Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations. 627-639 - Nai-Wen Chang, Sun-Yuan Hsieh:
A Survey for Conditional Diagnosability of Alternating Group Networks. 640-651 - Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. 652-663 - Ivona Bezáková, Wenbo Sun:
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. 664-676
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-10-16 01:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
