default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th CIAC 2019: Athens, Greece
- Pinar Heggernes:
Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. Lecture Notes in Computer Science 11485, Springer 2019, ISBN 978-3-030-17401-9 - Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
:
Quadratic Vertex Kernel for Split Vertex Deletion. 1-12 - Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The Temporal Explorer Who Returns to the Base. 13-24 - Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende:
Minimum Convex Partition of Point Sets. 25-37 - Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. 38-49 - Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. 50-61 - René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. 62-74 - Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project Games. 75-86 - Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. 87-98 - Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge:
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. 99-111 - Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman:
k -cuts on a Path. 112-123 - Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. 124-136 - Bugra Çaskurlu, Fatih Erdem Kizilkaya:
On Hedonic Games with Common Ranking Property. 137-148 - Janka Chlebíková, Clément Dallard, Niklas Paulsen:
Complexity of Scheduling for DARP with Soft Ride Times. 149-160 - Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. 161-173 - Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak:
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. 174-186 - Miguel Coviello Gonzalez, Marek Chrobak:
Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract). 187-198 - Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski:
Searching by Heterogeneous Agents. 199-211 - Adrian Dumitrescu:
Finding a Mediocre Player. 212-223 - Sándor P. Fekete, Dominik Krupke:
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. 224-236 - Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. 237-248 - Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. 249-261 - Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara:
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. 262-273 - Matthew P. Johnson:
Turing Tumble Is P(SPACE)-Complete. 274-285 - Frank Kammer, Andrej Sajenko:
Linear-Time In-Place DFS and BFS on the Word RAM. 286-298 - Adam Kunysz:
A Faster Algorithm for the Strongly Stable b-Matching Problem. 299-310 - Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination in Grids. 311-322 - Emanuele Natale, Iliad Ramezani:
On the Necessary Memory to Compute the Plurality in Multi-agent Systems. 323-338 - Ho Lam Pang, Leizhen Cai:
Complexity of Vertex Switching on Edge-Bicolored Graphs. 339-351 - Paolo Penna, Laurent Viennot:
Independent Lazy Better-Response Dynamics on Network Games. 352-364 - Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. 365-376
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-08-29 00:12 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.
