Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (English)
- New search for: Nederlof, Jesper
- New search for: Pilipczuk, Michat
- New search for: Swennenhuis, Céline M. F.
- New search for: Wegrzycki, Karol
- New search for: Nederlof, Jesper
- New search for: Pilipczuk, Michat
- New search for: Swennenhuis, Céline M. F.
- New search for: Wegrzycki, Karol
In:
Graph-theoretic concepts in computer science
; 27-39
;
2020
-
ISBN:
- Conference paper / Print
-
Title:Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
-
Contributors:Nederlof, Jesper ( author ) / Pilipczuk, Michat ( author ) / Swennenhuis, Céline M. F. ( author ) / Wegrzycki, Karol ( author )
-
Conference:WG ; 46. ; 2020 ; Online
-
Published in:
-
Publisher:
- New search for: Springer
-
Place of publication:Cham
-
Publication date:2020
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
- New search for: 54.10
- Further information on Basic classification
-
Keywords:
-
Classification:
BKL: 54.10 Theoretische Informatik -
Source:
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Combinatorial Bounds for Conflict-Free Coloring on Open NeighborhoodsBhyravarapu, Sriram / Kalyanasundaram, Subrahmanyam et al. | 2020
- 14
-
Guarding Quadrangulations and Stacked Triangulations with EdgesJungeblut, Paul / Ueckerdt, Torsten et al. | 2020
- 27
-
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial SpaceNederlof, Jesper / Pilipczuk, Michat / Swennenhuis, Céline M. F. / Wegrzycki, Karol et al. | 2020
- 40
-
Parameterized Inapproximability of Independent Set in H-Free GraphsDvorak, Pavel / Feldmann, Andreas Emil / Rai, Ashutosh / Rzqzewski, Pawel et al. | 2020
- 54
-
Clique-Width of Point ConfigurationsCagirict, Onur / Hlinény, Petr / Pokryvka, Filip / Sankaran, Abhisekh et al. | 2020
- 67
-
On the Complexity of Finding Large Odd Induced Subgraphs and Odd ColoringsBelmonte, Rémy / Sau, Ignasi et al. | 2020
- 80
-
Knot Diagrams of Treewidth TwoBodlaender, Hans L. / Burton, Benjamin / Fomv, Fedor V. / Grigoriev, Alexander et al. | 2020
- 92
-
Treewidth Versus Clique Number in Graph Classes with a Forbidden StructureDallard, Clément / Milanic, Martin / Storgel, Kenny et al. | 2020
- 106
-
Graph Isomorphism Restricted by ListsKlavik, Pavel / Knop, Dusan / Zeman, Peter et al. | 2020
- 119
-
Clique-Width: Harnessing the Power of AtomsDabrowski, Konrad K. / Masarik, Tomas / Novotna, Jana / Paulusma, Daniel / Rzqzewski, Pawel et al. | 2020
- 134
-
Edge Elimination and Weighted Graph ClassesBeisegel, Jesse / Chiarelli, Nina / Kohler, Ekkehard / Krnc, Matjaz / Milanic, Martin / Pivac, Nevena / Scheffler, Robert / Strehler, Martin et al. | 2020
- 148
-
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint PathsAhn, Jungho / Jaffke, Lars / Kwon, O-joung / Lima, Paloma T. et al. | 2020
- 161
-
Plattenbauten: Touching Rectangles in SpaceFelsner, Stefan / Knauer, Kolja / Ueckerdt, Torsten et al. | 2020
- 174
-
Universal Geometric GraphsFrati, Fabrizio / Hoffmann, Michael / Toth, Csaba D. et al. | 2020
- 187
-
Computing Subset Transversals in H-Free GraphsBrettell, Nick / Johnson, Matthew / Paesani, Giacomo / Paulusma, Daniel et al. | 2020
- 200
-
Feedback Edge Sets in Temporal GraphsHaag, Roman / Molter, Hendrik / Niedermeier, Rolf / Renken, Malte et al. | 2020
- 213
-
On Flips in Planar MatchingsMilich, Marcel / Mütze, Torsten / Pergel, Martin et al. | 2020
- 226
-
Degree Distribution for Duplication-Divergence Graphs: Large DeviationsFrieze, Alan / Turowski, Krzysztof / Szpankowski, Wojciech et al. | 2020
- 238
-
On Finding Balanced Bicliques via MatchingsChalermsook, Parinya / Jiamjitrak, Wanchote Po / Orgo, Ly et al. | 2020
- 248
-
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3Biedl, Therese / Klute, Fabian et al. | 2020
- 261
-
Strong Cliques in Diamond-Free GraphsChiarelli, Nina / Martinez-Barona, Berenice / Milanic, Martin / Monnot, Jérome / Mursic, Peter et al. | 2020
- 274
-
Recognizing k-Clique Extendible OrderingsFrancis, Mathew / Neogi, Rian / Raman, Venkatesh et al. | 2020
- 286
-
Linear-Time Recognition of Double-Threshold GraphsKobayashi, Yusuke / Okamoto, Yoshio / Otachi, Yota / Uno, Yushi et al. | 2020
- 298
-
Characterization and Linear-Time Recognition of Paired Threshold GraphsCao, Yixin / Rong, Guozhen / Wang, Jianxin et al. | 2020
- 310
-
Drawing Graphs as SpannersAichholzer, Oswin / Borrazzo, Manuel / Bose, Prosenjit / Cardinal, Jean / Frati, Fabrizio / Morin, Pat / Vogtenhuber, Birgit et al. | 2020
- 325
-
Inserting One Edge into a Simple Drawing Is HardArroyo, Alan / Klute, Fabian / Parada, Irene / Seidel, Raimund / Vogtenhuber, Birgit / Wiedera, Tilo et al. | 2020
- 339
-
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding SettingAngelini, Patrizio / Bekos, Michael A. / Forster, Henry / Gronemann, Martin et al. | 2020
- 352
-
2.5-Connectivity: Unique Components, Critical Graphs, and ApplicationsHeinrich, Irene / Heller, Till / Schmidt, Eva / Streicher, Manuel et al. | 2020
- 364
-
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II — Recognition and ComplexityFujita, Shinya / Park, Boram / Sakuma, Tadashi et al. | 2020
- 376
-
The Linear Arboricity Conjecture for 3-Degenerate GraphsBasavaraju, Manu / Bishnu, Arijit / Francis, Mathew / Pattanayak, Drimit et al. | 2020
- 388
-
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-widthBenjamin, Bergougnoux / Papadopoulos, Charis / Telle, Jan Arne et al. | 2020
- 401
-
Weighted Additive SpannersAhmed, Reyan / Bodwin, Greg / Sahneh, Faryad Darabi / Kobourov, Stephen / Spence, Richard et al. | 2020