CIAC C

31 papers

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