default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th CIAC 2021: Virtual Event
- Tiziana Calamoneri
, Federico Corò:
Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings. Lecture Notes in Computer Science 12701, Springer 2021, ISBN 978-3-030-75241-5
Invited Lectures
- Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor:
Invited Talks. 3-19 - Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Abundant Extensions. 3-17 - Katharina T. Huber:
Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes. 18 - Joseph (Seffi) Naor:
Recent Advances in Competitive Analysis of Online Algorithms. 19
Contributed Papers
- Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Three Problems on Well-Partitioned Chordal Graphs. 23-36 - Saeed Akhoondian Amiri, Ben Wiederhake:
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs. 37-60 - Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions via Recombination. 61-74 - Susanne Albers, Jens Quedenfeld:
Algorithms for Energy Conservation in Heterogeneous Data Centers. 75-89 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Vertex-Weighted Graph Realizations. 90-102 - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the Role of 3's for the 1-2-3 Conjecture. 103-115 - Ioana O. Bercea, Guy Even:
Upper Tail Analysis of Bucket Sort and Random Tries. 116-129 - Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput Scheduling with Equal Additive Laxity. 130-143 - Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. 144-157 - Guilherme de Castro Mendes Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and Kernelization Algorithms for the Induced Tree Problem. 158-172 - Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
The Multi-budget Maximum Weighted Coverage Problem. 173-186 - Rajesh Chitnis:
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. 187-201 - Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. 202-215 - Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. 216-230 - Till Fluschnik:
A Multistage View on 2-Satisfiability. 231-244 - Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky:
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties. 245-257 - Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. 258-270 - Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. 271-285 - Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a Set of Line Segments with a Few Squares. 286-299 - Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. 300-313 - Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. 314-325 - Csaba Király, András Mihálykó:
Globally Rigid Augmentation of Minimally Rigid Graphs in R2. 326-339 - Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. 340-353 - Christian Komusiewicz, Nils Morawietz:
Can Local Optimality Be Used for Efficient Data Reduction? 354-366 - Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. 367-380 - Bengt J. Nilsson, Gordana Vujovic:
Online Two-Dimensional Vector Packing With Advice. 381-393 - Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan:
Temporal Matching on Geometric Graph Data. 394-408
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-04-25 00:23 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
