default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2020: Bordeaux, France
- Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12126, Springer 2020, ISBN 978-3-030-48965-6
Invited Paper
- Sándor P. Fekete
:
Coordinating Swarms of Objects at Extreme Dimensions. 3-13
Contributed Papers
- Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A Family of Tree-Based Generators for Bubbles in Directed Graphs. 17-29 - Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The Micro-world of Cographs. 30-42 - Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. 43-55 - Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. 56-68 - Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki:
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework. 69-82 - Toni Böhnlein, Oliver Schaudt:
On the Complexity of Stackelberg Matroid Pricing Problems. 83-96 - Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. 97-111 - Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. 112-125 - Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. 126-139 - Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Further Results on Online Node- and Edge-Deletion Problems with Advice. 140-153 - Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Packing of Independent Sets. 154-165 - Pratibha Choudhary:
Polynomial Time Algorithms for Tracking Path Problems. 166-179 - Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen:
New Bounds for Maximizing Revenue in Online Dial-a-Ride. 180-194 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Iterated Type Partitions. 195-210 - Peter Damaschke:
Two Robots Patrolling on a Line: Integer Version and Approximability. 211-223 - Peter Damaschke:
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. 224-236 - Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. 237-250 - Ewa Drgas-Burchardt, Hanna Furmanczyk, Elzbieta Sidorowicz:
Equitable d-degenerate Choosability of Graphs. 251-263 - Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the Complexity of Broadcast Domination and Multipacking in Digraphs. 264-276 - Kishen N. Gowda, Neeldhara Misra, Vraj Patel:
A Parameterized Perspective on Attacking and Defending Elections. 277-288 - Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. 289-303 - Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. 304-315 - Toru Hasunuma:
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. 316-329 - Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino:
The Steiner Problem for Count Matroids. 330-342 - Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. 343-354 - Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between Proper and Strong Edge-Colorings of Subcubic Graphs. 355-367 - Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. 368-381 - Erin Lanus, Charles J. Colbourn:
Algorithms for Constructing Anonymizing Arrays. 382-394 - Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. 395-408 - B. S. Panda, Juhi Chaudhary:
Acyclic Matching in Some Subclasses of Graphs. 409-421
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 2024-11-15 19:19 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
