Dimitrios M. Thilikos

SIAM J. Discret. Math., December, 2023

Edge-treewidth: Algorithmic and combinatorial properties.

[BibT_eX]

[DOI]

Loïc Magne

Abhijat Sharma

Discret. Appl. Math., December, 2023

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm.

[BibT_eX]

[DOI]

SIAM J. Comput., August, 2023

Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs.

[BibT_eX]

[DOI]

Inf. Comput., August, 2023

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

k-apices of minor-closed graph classes. I. Bounding the obstructions.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, July, 2023

On Strict Brambles.

[BibT_eX]

[DOI]

Emmanouil Lardas

Evangelos Protopapas

Graphs Comb., April, 2023

The mixed search game against an agile and visible fugitive is monotone.

[BibT_eX]

[DOI]

Guillaume Mescoff

Discret. Math., April, 2023

Universal Obstructions of Graph Parameters.

[BibT_eX]

[DOI]

Evangelos Protopapas

CoRR, 2023

Approximating branchwidth on parametric extensions of planarity.

[BibT_eX]

[DOI]

CoRR, 2023

Graph Parameters, Universal Obstructions, and WQO.

[BibT_eX]

[DOI]

Evangelos Protopapas

CoRR, 2023

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.

[BibT_eX]

[DOI]

Nicole Schirrmacher

Sebastian Siebertz

Alexandre Vigny

CoRR, 2023

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Excluding Single-Crossing Matching Minors in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Kernelization for Graph Packing Problems via Rainbow Matching.

[BibT_eX]

[DOI]

Stéphane Bessy

Marin Bougeret

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Dynamic Programming on Bipartite Tree Decompositions.

[BibT_eX]

[DOI]

Lars Jaffke

Laure Morelle

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.

[BibT_eX]

[DOI]

Laure Morelle

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Compound Logics for Modification Problems.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, December, 2022

Parameterized Complexity of Elimination Distance to First-Order Logic Properties.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2022

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

SIAM J. Discret. Math., 2022

Block Elimination Distance.

[BibT_eX]

[DOI]

Öznur Yasar Diner

Graphs Comb., 2022

A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.

[BibT_eX]

[DOI]

Guillaume Mescoff

Discret. Appl. Math., 2022

Contraction Bidimensionality of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

Killing a vortex.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.

[BibT_eX]

[DOI]

Michal Pilipczuk

Marcin Wrochna

SIAM J. Discret. Math., 2021

Minimum Reload Cost Graph Factors.

[BibT_eX]

[DOI]

Didem Gözüpek

Mordechai Shalom

Theory Comput. Syst., 2021

Connected search for a lazy robber.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

A Menger-like property of tree-cut width.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2021

Minor obstructions for apex-pseudoforests.

[BibT_eX]

[DOI]

Alexandros Leivaditis

Alexandros Singh

Konstantinos Tsatsanis

Discret. Math., 2021

Compactors for parameterized counting problems.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2021

Edge-trewidth: Algorithmic and combinatorial properties.

[BibT_eX]

[DOI]

Loïc Magne

Abhijat Sharma

CoRR, 2021

k-apices of minor-closed graph classes. I. Bounding the obstructions.

[BibT_eX]

[DOI]

CoRR, 2021

A more accurate view of the Flat Wall Theorem.

[BibT_eX]

[DOI]

CoRR, 2021

A Constant-Factor Approximation for Weighted Bond Cover.

[BibT_eX]

[DOI]

Eun Jung Kim

Euiwoong Lee

Proceedings of the Approximation, 2021

2020

Edge degeneracy: Algorithmic and structural results.

[BibT_eX]

[DOI]

Stratis Limnios

Joanny Perret

Theor. Comput. Sci., 2020

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Bidimensionality and Kernels.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.

[BibT_eX]

[DOI]

Networks, 2020

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Hitting minors on bounded treewidth graphs. III. Lower bounds.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Structure and enumeration of K4-minor-free links and link-diagrams.

[BibT_eX]

[DOI]

Vasiliki Velona

Eur. J. Comb., 2020

Minor-obstructions for apex sub-unicyclic graphs.

[BibT_eX]

[DOI]

Alexandros Leivaditis

Alexandros Singh

Konstantinos Tsatsanis

Vasiliki Velona

Discret. Appl. Math., 2020

Sparse obstructions for minor-covering parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

k-apices of minor-closed graph classes. II. Parameterized algorithms.

[BibT_eX]

[DOI]

CoRR, 2020

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph.

[BibT_eX]

[DOI]

Guillaume Mescoff

CoRR, 2020

Subgraph Complementation.

[BibT_eX]

[DOI]

Torstein J. F. Strømme

Algorithmica, 2020

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Hcore-Init: Neural Network Initialization based on Graph Degeneracy.

[BibT_eX]

[DOI]

Stratis Limnios

George Dasoulas

Proceedings of the 25th International Conference on Pattern Recognition, 2020

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

A Retrospective on (Meta) Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Preface to special issue on Theory and Applications of Graph Searching.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Nicolas Nisse

Theor. Comput. Sci., 2019

Cutwidth: Obstructions and Algorithmic Aspects.

[BibT_eX]

[DOI]

Michal Pilipczuk

Marcin Wrochna

Algorithmica, 2019

Explicit Linear Kernels for Packing Problems.

[BibT_eX]

[DOI]

Valentin Garnero

Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Modification to Planarity is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Clustering to Given Connectivities.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Structured Connectivity Augmentation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Structure and Enumeration of K4-minor-free links and link diagrams.

[BibT_eX]

[DOI]

Vasiliki Velona

Electron. Notes Discret. Math., 2018

An FPT 2-Approximation for Tree-Cut Decomposition.

[BibT_eX]

[DOI]

Algorithmica, 2018

An O(log OPT)-Approximation for Covering and Packing Minor Models of θr.

[BibT_eX]

[DOI]

Algorithmica, 2018

Partial Complementation of Graphs.

[BibT_eX]

[DOI]

Torstein J. F. Strømme

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Data-Compression for Parametrized Counting Problems on Sparse Graphs.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma.

[BibT_eX]

[DOI]

John Livieratos

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017

Acyclic edge coloring through the Lovász Local Lemma.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Parameterized Complexity of Graph Cyclability.

[BibT_eX]

[DOI]

Spyridon Maniatis

SIAM J. Discret. Math., 2017

Low Polynomial Exclusion of Planar Graph Patterns.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Irrelevant vertices for the planar Disjoint Paths Problem.

[BibT_eX]

[DOI]

Stavros G. Kolliopoulos

Philipp Klaus Krause

J. Comb. Theory, Ser. B, 2017

Parameterized algorithms for min-max multiway cut and list digraph homomorphism.

[BibT_eX]

[DOI]

Eun Jung Kim

Konrad Kazimierz Dabrowski

J. Comput. Syst. Sci., 2017

Editing to a planar graph of given degrees.

[BibT_eX]

[DOI]

Pim van 't Hof

J. Comput. Syst. Sci., 2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.

[BibT_eX]

[DOI]

Mathias Weller

J. Comput. Syst. Sci., 2017

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.

[BibT_eX]

[DOI]

Iyad A. Kanj

Ge Xia

Inf. Comput., 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Minors in graphs of large ϴr-girth.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Recent techniques and results on the Erdős-Pósa property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

A linear kernel for planar red-blue dominating set.

[BibT_eX]

[DOI]

Valentin Garnero

Discret. Appl. Math., 2017

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Branchwidth of Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Bidimensionality.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.

[BibT_eX]

[DOI]

Nicolas Nisse

Theor. Comput. Sci., 2016

Minimal disconnected cuts in planar graphs.

[BibT_eX]

[DOI]

Anthony Stewart

Networks, 2016

(Meta) Kernelization.

[BibT_eX]

[DOI]

J. ACM, 2016

An edge variant of the Erdős-Pósa property.

[BibT_eX]

[DOI]

Discret. Math., 2016

Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013.

[BibT_eX]

[DOI]

Pinar Heggernes

Andrzej Proskurowski

Discret. Appl. Math., 2016

Contraction obstructions for connected graph searching.

[BibT_eX]

[DOI]

Micah J. Best

Arvind Gupta

Discret. Appl. Math., 2016

A k-core Decomposition Framework for Graph Clustering.

[BibT_eX]

[DOI]

Fragkiskos D. Malliaros

Nikolaos Tziortziotis

Charanpal Dhanjal

Emmanouil Kiagias

CoRR, 2016

Planar Disjoint-Paths Completion.

[BibT_eX]

[DOI]

Stavros G. Kolliopoulos

Algorithmica, 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

FPT Algorithms for Plane Completion Problems.

[BibT_eX]

[DOI]

Spyridon Maniatis

Clément Requilé

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Explicit Linear Kernels via Dynamic Programming.

[BibT_eX]

[DOI]

Valentin Garnero

SIAM J. Discret. Math., 2015

Forbidding Kuratowski Graphs as Immersions.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

J. Graph Theory, 2015

An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

Bidimensionality and Parameterized Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Variants of Plane Diameter Completion.

[BibT_eX]

[DOI]

Clément Requilé

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

An alternative proof for the constructive Asymmetric Lovász Local Lemma.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Fixed Parameter Algorithm for Plane Subgraph Completion.

[BibT_eX]

Clément Requilé

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Dynamic programming for graphs on surfaces.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Report on NII Shonan Meeting 2013-018.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Bull. EATCS, 2014

On the Algorithmic Lovász Local Lemma.

[BibT_eX]

[DOI]

CoRR, 2014

Bidimensionality of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Alexander Grigoriev

Athanassios Koutsonas

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Quantifying trust dynamics in signed graphs, the S-Cores approach.

[BibT_eX]

[DOI]

Bogdan Cautis

Silviu Maniu

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

CoreCluster: A Degeneracy Based Graph Clustering Framework.

[BibT_eX]

[DOI]

Fragkiskos D. Malliaros

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Increasing the minimum degree of a graph by contractions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Optimizing the Graph Minors Weak Structure Theorem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2).

[BibT_eX]

[DOI]

Gregory Z. Gutin

Kazuo Iwama

NII Shonan Meet. Rep., 2013

D-cores: measuring collaboration of directed graphs based on degeneracy.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2013

Asymptotic enumeration of non-crossing partitions on surfaces.

[BibT_eX]

[DOI]

Discret. Math., 2013

Characterizing graphs of small carving-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121).

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Dagstuhl Reports, 2013

Polynomial Gap Extensions of the Erdős-Pósa Theorem.

[BibT_eX]

[DOI]

CoRR, 2013

Excluding Graphs as Immersions in Surface Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Induced packing of odd cycles in planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Foreword: Special Issue on Theory and Applications of Graph Searching Problems.

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2012

On exact algorithms for treewidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Catalan structures and dynamic programming in H-minor-free graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Connected graph searching.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Forbidden graphs for tree-depth.

[BibT_eX]

[DOI]

Zdenek Dvorák

Eur. J. Comb., 2012

On graph contractions and induced minors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Containment relations in split graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.

[BibT_eX]

[DOI]

Paul Hunter

Discret. Appl. Math., 2012

Fast Minor Testing in Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Contraction checking in graphs on surfaces.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Linear kernels for (connected) dominating set on H-minor-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Visual exploration of collaboration networks based on graph degeneracy.

[BibT_eX]

[DOI]

Klaus Berberich

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Dynamic Programming for H-minor-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Graph Minors and Parameterized Algorithm Design.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Parameterizing cut sets in a graph by the number of their components.

[BibT_eX]

[DOI]

Takehiro Ito

Theor. Comput. Sci., 2011

Special Issue on "Theory and Applications of Graph Searching Problems".

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2011

Faster parameterized algorithms for minor containment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Searching for a Visible, Lazy Fugitive.

[BibT_eX]

[DOI]

David Richerby

SIAM J. Discret. Math., 2011

Approximating Width Parameters of Hypergraphs with Excluded Minors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Strengthening Erdös-Pósa property for minor-closed graph classes.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Contracting planar graphs to contractions of triangulations.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Contraction obstructions for treewidth.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2011

Square Roots of Minor Closed Graph Classes.

[BibT_eX]

[DOI]

Nestor V. Nestoridis

Electron. Notes Discret. Math., 2011

Outerplanar Obstructions for Matroid Pathwidth.

[BibT_eX]

[DOI]

Athanassios Koutsonas

Koichi Yamazaki

Electron. Notes Discret. Math., 2011

Lift Contractions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A min-max theorem for LIFO-search.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Paths of bounded length and their cuts: Parameterized complexity and algorithms.

[BibT_eX]

[DOI]

Discret. Optim., 2011

On self-duality of branchwidth in graphs of bounded genus.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

On disconnected cuts and separators.

[BibT_eX]

[DOI]

Takehiro Ito

Discret. Appl. Math., 2011

Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).

[BibT_eX]

[DOI]

Stephan Kreutzer

Dagstuhl Reports, 2011

Confronting intractability via parameters.

[BibT_eX]

[DOI]

Rodney G. Downey

Comput. Sci. Rev., 2011

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.

[BibT_eX]

[DOI]

Athanassios Koutsonas

Algorithmica, 2011

On the Existence of Nash Equilibria in Strategic Search Games.

[BibT_eX]

[DOI]

Carme Àlvarez

Amalia Duch

Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Tight Bounds for Linkages in Planar Graphs.

[BibT_eX]

[DOI]

Stavros G. Kolliopoulos

Philipp Klaus Krause

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Fast Sub-exponential Algorithms and Compactness in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Odd cyclic surface separators in planar graphs.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Evaluating Cooperation in Communities with the k-Core Structure.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

2010

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Rank-width and tree-width of H-minor-free graphs.

[BibT_eX]

[DOI]

Sang-il Oum

Eur. J. Comb., 2010

A note on the subgraphs of the (2×∞)-grid.

[BibT_eX]

[DOI]

Discret. Math., 2010

Approximation Algorithms for Domination Search.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

On Contracting Graphs to Fixed Pattern Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Contractions of Planar Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Graph Searching in a Crime Wave.

[BibT_eX]

[DOI]

David Richerby

SIAM J. Discret. Math., 2009

Parameterized complexity of finding regular induced subgraphs.

[BibT_eX]

[DOI]

Hannes Moser

J. Discrete Algorithms, 2009

Derivation of algorithms for cutwidth and related graph layout parameters.

[BibT_eX]

[DOI]

Michael R. Fellows

J. Comput. Syst. Sci., 2009

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Outerplanar Obstructions for the Feedback Vertex Set.

[BibT_eX]

[DOI]

Konstantinos S. Stavropoulos

Electron. Notes Discret. Math., 2009

Obstructions for Tree-depth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Approximating Acyclicity Parameters of Sparse Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Induced Packing of Odd Cycles in a Planar Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Contraction Bidimensionality: the Accurate Picture.

[BibT_eX]

[DOI]

Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008

Branchwidth of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An annotated bibliography on guaranteed graph searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Forewords: Special issue on graph searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Efficient algorithms for counting parameterized list H-colorings.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Subexponential parameterized algorithms.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.

[BibT_eX]

[DOI]

Sue Whitesides

Algorithmica, 2008

Catalan structures and dynamic programming in H-minor-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Improving the gap of Erdös-Pósa property for minor-closed graph classes.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

On self duality of pathwidth in polyhedral graph embeddings.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Complexity issues on bounded restrictive H-coloring.

[BibT_eX]

[DOI]

Discret. Math., 2007

Invitation to fixed-parameter algorithms.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2007

2006

The Bidimensional Theory of Bounded-Genus Graphs.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

SIAM J. Discret. Math., 2006

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

New upper bounds on the decomposability of planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Kernels for the Vertex Cover Problem on the Preferred Attachment Model.

[BibT_eX]

[DOI]

Jordi Petit

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Fast FPT-Algorithms for Cleaning Grids.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

2005

Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Cutwidth II: Algorithms for partial w-trees of bounded degree.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Cutwidth I: A linear time fixed parameter algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.

[BibT_eX]

[DOI]

J. ACM, 2005

Connected Graph Searching in Outerplanar Graphs.

[BibT_eX]

[DOI]

Ioan Todinca

Electron. Notes Discret. Math., 2005

Parameterized Complexity for Graph Layout Problems.

[BibT_eX]

Bull. EATCS, 2005

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

The restrictive H-coloring problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.

[BibT_eX]

[DOI]

Algorithmica, 2005

Parameterized Counting Algorithms for General Graph Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

Bidimensional Parameters and Local Treewidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

A 3-approximation for the pathwidth of Halin graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

A Simple and Fast Approach for Solving Problems on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Computing Small Search Numbers in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

On the monotonicity of games generated by symmetric submodular functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Searching Is Not Jumping.

[BibT_eX]

[DOI]

Lali Barrière

Nicola Santoro

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.

[BibT_eX]

[DOI]

Michael R. Fellows

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dominating Sets and Local Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Counting H-colorings of partial k-trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On Graph Powers for Leaf-Labeled Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2002

The Complexity of Restrictive H-Coloring.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

H-Colorings of Large Degree Graphs.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Stability and non-stability of the FIFO protocol.

[BibT_eX]

[DOI]

Dimitrios Koukopoulos

Sotiris E. Nikoletseas

Paul G. Spirakis

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

(H, C, K)-Coloring: Fast, Easy, and Hard Cases.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Recent Results on Parameterized H-Colorings.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Finding Smallest Supertrees Under Minor Containment.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2000

Algorithms and obstructions for linear-width and related search parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints.

[BibT_eX]

[DOI]

Nick D. Dendris

Constraints An Int. J., 2000

Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Graphs with Branchwidth at Most Three.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Quickly Excluding K2, r from Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Monotonicity and inert fugitive search games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Isomorphism for Graphs of Bounded Distance Width.

[BibT_eX]

[DOI]

Koichi Yamazaki

Babette de Fluiter

Algorithmica, 1999

1997

Fugitive-Search Games on Graphs and Related Parameters.

[BibT_eX]

[DOI]

Nick D. Dendris

Theor. Comput. Sci., 1997

Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

It is Hard to Know when Greedy is Good for Finding Independent Sets.

[BibT_eX]

[DOI]

Koichi Yamazaki

Inf. Process. Lett., 1997

On Interval Routing Schemes and Treewidth.

[BibT_eX]

[DOI]

Jan van Leeuwen

Richard B. Tan

Inf. Comput., 1997

Treewidth for Graphs with Small Chordality.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Constructive Linear Time Algorithms for Branchwidth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

The Linkage of a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

1995

Partiality and Approximation Schemes for Local Consistency in Networks of Constraints.

[BibT_eX]

[DOI]

Nick D. Dendris

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Partial Arc Consistency.

[BibT_eX]

[DOI]

Nick Lendris