Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings > Extension of Vertex Cover and Independent Set in Some Classes of Graphs
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings |
Pinar Heggernes
Springer International Publishing
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
Authors

Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikoalei; Jérôme Monnot; Florian Sikora

ARI Id

1665184495831_5203582

Access

Not Available Free

Pages

124-136

DOI

10.1007/978-3-030-17402-6_11

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-030-17402-6_11

Table of Contents of Book
Showing 1 to 20 of 32 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xiii
Quadratic Vertex Kernel for Split Vertex Deletion
Akanksha Agrawal; Sushmita Gupta; Pallavi Jain; R. Krithika
1-12
The Temporal Explorer Who Returns to the Base
Eleni C. Akrida; George B. Mertzios; Paul G. Spirakis
13-24
Minimum Convex Partition of Point Sets
Allan S. Barboza; Cid C. de Souza; Pedro J. de Rezende
25-37
Parameterized Complexity of Safe Set
Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono; Yota Otachi
38-49
Parameterized Complexity of Diameter
Matthias Bentert; André Nichterlein
50-61
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints
René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche
62-74
Project Games
Vittorio Bilò; Laurent Gourvès; Jérôme Monnot
75-86
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender; Tesshu Hanaka; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden
87-98
Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors
Laurent Bulteau; Niels Grüttemeier; Christian Komusiewicz; Manuel Sorge
99-111
\(k\) -cuts on a Path
Xing Shi Cai; Luc Devroye; Cecilia Holmgren; Fiona Skerman
112-123
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikoalei; Jérôme Monnot; Florian Sikora
124-136
On Hedonic Games with Common Ranking Property
Bugra Caskurlu; Fatih Erdem Kizilkaya
137-148
Complexity of Scheduling for DARP with Soft Ride Times
Janka Chlebíková; Clément Dallard; Niklas Paulsen
149-160
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set
Pratibha Choudhary; Pallavi Jain; R. Krithika; Vibha Sahlot
161-173
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements
Serafino Cicerone; Gabriele Di Stefano; Leszek Gasieniec; Tomasz Jurdzinski; Alfredo Navarra; Tomasz Radzik et al.
174-186
Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract)
Miguel Coviello Gonzalez; Marek Chrobak
187-198
Searching by Heterogeneous Agents
Dariusz Dereniowski; Łukasz Kuszner; Robert Ostrowski
199-211
Finding a Mediocre Player
Adrian Dumitrescu
212-223
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation
Sándor P. Fekete; Dominik Krupke
224-236
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 32 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings