Petr A. Golovach

Pierre Fraigniaud

Theor. Comput. Sci., 2024

Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective.

[BibT_eX]

[DOI]

CoRR, 2024

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Matthias Bentert

CoRR, 2024

Stability in Graphs with Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Tree Containment Above Minimum Degree is FPT.

[BibT_eX]

[DOI]

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

Breaking a Graph into Connected Components with Small Dominating Sets.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Computing Tree Decompositions with Small Independence Number.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Two-Sets Cut-Uncut on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Cuts in Graphs with Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

How to Guide a Present-Biased Agent Through Prescribed Tasks?

[BibT_eX]

[DOI]

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Hybrid k-Clustering: Blending k-Median and k-Center.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Combing a Linkage in an Annulus.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Detours in directed graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

How to find a good explanation for clustering?

[BibT_eX]

[DOI]

Artif. Intell., September, 2023

Lossy Kernelization of Same-Size Clustering.

[BibT_eX]

[DOI]

Theory Comput. Syst., 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

A survey of parameterized algorithms and the complexity of edge modification.

[BibT_eX]

[DOI]

Comput. Sci. Rev., May, 2023

Parameterized Complexity of Feature Selection for Categorical Data Clustering.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2023

Parameterized complexity of categorical clustering with size constraints.

[BibT_eX]

[DOI]

Nidhi Purohit

J. Comput. Syst. Sci., 2023

Turán's Theorem Through Algorithmic Lens.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Kernelizing Temporal Exploration Problems.

[BibT_eX]

[DOI]

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

Computing Paths of Large Rank in Planar Frameworks Deterministically.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Compound Logics for Modification Problems.

[BibT_eX]

[DOI]

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

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Kernelization for Spreading Points.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 13th International Conference, 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

Partitioning H-free graphs of bounded diameter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Graph Square Roots of Small Distance from Degree One Graphs.

[BibT_eX]

[DOI]

Paloma T. Lima

Charis Papadopoulos

Theory Comput. Syst., 2022

Present-biased optimization.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Math. Soc. Sci., 2022

Induced Disjoint Paths in AT-free graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration.

[BibT_eX]

[DOI]

Christian Komusiewicz

Van Bang Le

J. Comput. Syst. Sci., 2022

Cyclability in graph classes.

[BibT_eX]

[DOI]

Christophe Crespelle

Discret. Appl. Math., 2022

(Re)packing Equal Disks into Rectangle.

[BibT_eX]

[DOI]

CoRR, 2022

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Meirav Zehavi

Algorithmica, 2022

Parameterized Complexity of Directed Spanner Problems.

[BibT_eX]

[DOI]

Algorithmica, 2022

Algorithmic Extensions of Dirac's Theorem.

[BibT_eX]

[DOI]

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

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Exact Exponential Algorithms for Clustering Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

FPT Approximation for Fair Minimum-Load Clustering.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

(Re)packing Equal Disks into Rectangle.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Longest Cycle Above Erdős-Gallai Bound.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Multiplicative Parameterization Above a Guarantee.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Kernelization of Whitney Switches.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Kernelization of Graph Hamiltonicity: Proper H-Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Parameterized k-Clustering: Tractability island.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

[BibT_eX]

[DOI]

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

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

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

Partitioning H-Free Graphs of Bounded Diameter.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Going Far from Degeneracy.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Finding connected secluded subgraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Parameterized low-rank binary matrix approximation.

[BibT_eX]

[DOI]

Fahad Panolan

Data Min. Knowl. Discov., 2020

Enumeration of minimal connected dominating sets for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Aspects of Strong Subgraph Closure.

[BibT_eX]

[DOI]

Athanasios L. Konstantinidis

Paloma T. Lima

Charis Papadopoulos

Algorithmica, 2020

Subgraph Complementation.

[BibT_eX]

[DOI]

Torstein J. F. Strømme

Algorithmica, 2020

On the Tractability of Optimization Problems on H-Graphs.

[BibT_eX]

[DOI]

Jean-Florent Raymond

Algorithmica, 2020

Parameterized Complexity of PCA (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Recognizing Proper Tree-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Parameterization Above a Multiplicative Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

On the Complexity of Recovering Incidence Matrices.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Low-Rank Binary Matrix Approximation in Column-Sum Norm.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Enumeration of maximal irredundant sets for claw-free graphs.

[BibT_eX]

[DOI]

Mohamed Yosri Sayadi

Theor. Comput. Sci., 2019

Enumeration and maximum number of minimal dominating sets for chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Spanning Circuits in Regular Matroids.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Editing to Connected F-Degree Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Enumeration and maximum number of maximal irredundant sets for chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Parameterized k-Clustering: The distance matters!

[BibT_eX]

[DOI]

CoRR, 2019

Surjective H-colouring: New hardness results.

[BibT_eX]

[DOI]

Comput., 2019

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

[BibT_eX]

[DOI]

Algorithmica, 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

Cyclability in Graph Classes.

[BibT_eX]

[DOI]

Christophe Crespelle

Carl Feghali

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Refined Complexity of PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Parameterized k-Clustering: Tractability Island.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Structured Connectivity Augmentation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Covering Vectors by Spaces: Regular Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Finding Cactus Roots in Polynomial Time.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Enumeration and maximum number of minimal connected vertex covers in graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Computing square roots of graphs with low maximum degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421).

[BibT_eX]

[DOI]

Henning Fernau

Marie-France Sagot

Dagstuhl Reports, 2018

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Sigve Hortemo Sæther

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

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Graph editing to a given degree sequence.

[BibT_eX]

[DOI]

George B. Mertzios

Theor. Comput. Sci., 2017

A linear kernel for finding square roots of almost planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Parameterized Complexity of Graph Cyclability.

[BibT_eX]

[DOI]

Spyridon Maniatis

Konrad Kazimierz Dabrowski

SIAM J. Discret. Math., 2017

Metric Dimension of Bounded Tree-length Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Parameterized Complexity of Secluded Connectivity Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Editing to a planar graph of given degrees.

[BibT_eX]

[DOI]

Pim van 't Hof

J. Comput. Syst. Sci., 2017

Editing to a connected graph of given degrees.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Graph editing to a fixed target.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Iain A. Stewart

Discret. Appl. Math., 2017

On recognition of threshold tolerance graphs and their complements.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

Minimal dominating sets in interval graphs and trees.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Appl. Math., 2017

Parameterized Complexity of Superstring Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Induced disjoint paths in circular-arc graphs in linear time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Enumerating minimal connected dominating sets in graphs of bounded chordality.

[BibT_eX]

[DOI]

Konrad Kazimierz Dabrowski

Theor. Comput. Sci., 2016

Editing to Eulerian graphs.

[BibT_eX]

[DOI]

Pim van 't Hof

J. Comput. Syst. Sci., 2016

Parameterized complexity of the anchored k-core problem for directed graphs.

[BibT_eX]

[DOI]

Rajesh Chitnis

Inf. Comput., 2016

Squares of Low Clique Number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

How to hunt an invisible rabbit on a graph.

[BibT_eX]

[DOI]

Tatjana V. Abramovskaya

Michal Pilipczuk

Eur. J. Comb., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Appl. Math., 2016

Squares of Low Maximum Degree.

[BibT_eX]

[DOI]

CoRR, 2016

Parameterized Algorithms for Finding Square Roots.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Editing to a Graph of Given Degrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Induced Disjoint Paths in Claw-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Hadwiger Number of Graphs with Small Chordality.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Minimizing Rosenthal Potential in Multicast Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Coloring graphs characterized by a forbidden subgraph.

[BibT_eX]

[DOI]

Bernard Ries

Discret. Appl. Math., 2015

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.

[BibT_eX]

[DOI]

Algorithmica, 2015

Modifying a Graph Using Vertex Elimination.

[BibT_eX]

[DOI]

Algorithmica, 2015

List Coloring in the Absence of a Linear Forest.

[BibT_eX]

[DOI]

Algorithmica, 2015

Metric Dimension of Bounded Width Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Variants of Plane Diameter Completion.

[BibT_eX]

[DOI]

Clément Requilé

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

2014

Colouring of graphs with Ramsey-type forbidden subgraphs.

[BibT_eX]

[DOI]

Konrad K. Dabrowski

Theor. Comput. Sci., 2014

Solutions for the stable roommates problem with payments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Long Circuits and Large Euler Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Subset feedback vertex sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Parameterized complexity of connected even/odd subgraph problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Closing complexity gaps for coloring problems on H-free graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Coloring graphs without short cycles and long induced paths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

List coloring in the absence of two subgraphs.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Discret. Appl. Math., 2014

Finding clubs in graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2014

Parameterized complexity of three edge contraction problems with degree constraints.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Recognizing Threshold Tolerance Graphs in O(n2) Time.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

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

Parameterized Algorithms to Preserve Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Connecting Vertices by Independent Trees.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Increasing the minimum degree of a graph by contractions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Detecting induced minors in AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Obtaining planarity by contracting few edges.

[BibT_eX]

[DOI]

Pim van 't Hof

Theor. Comput. Sci., 2013

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.

[BibT_eX]

[DOI]

Hajo Broersma

Viresh Patel

Theor. Comput. Sci., 2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Choosability on H-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Three complexity results on coloring Pk-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

4-coloring H-free graphs when H is small.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Sparse Square Roots.

[BibT_eX]

[DOI]

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

On the Parameterized Complexity of Cutting a Few Vertices from a Graph.

[BibT_eX]

[DOI]

Janne H. Korhonen

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Cliques and Clubs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Preventing Unraveling in Social Networks Gets Harder.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Computing vertex-surjective homomorphisms to partially reflexive trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Induced packing of odd cycles in planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Updating the complexity status of coloring graphs without a fixed induced linear forest.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Cops and Robber with Constraints.

[BibT_eX]

[DOI]

Pawel Pralat

SIAM J. Discret. Math., 2012

Cops and Robber Game Without Recharging.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Theory Comput. Syst., 2012

On the parameterized complexity of coloring graphs in the absence of a linear forest.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Parameterized complexity of generalized domination problems.

[BibT_eX]

[DOI]

Ondrej Suchý

Discret. Appl. Math., 2012

Containment relations in split graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Edge search number of cographs.

[BibT_eX]

[DOI]

Rodica Mihai

Discret. Appl. Math., 2012

Distance three labelings of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

[BibT_eX]

[DOI]

CoRR, 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Algorithmica, 2012

Finding vertex-surjective graph homomorphisms.

[BibT_eX]

[DOI]

Acta Informatica, 2012

How to Eliminate a Graph.

[BibT_eX]

[DOI]

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

k-Gap Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

Bandwidth on AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Guard games on graphs: Keep the intruder out!

[BibT_eX]

[DOI]

Daniel Lokshtanov

Theor. Comput. Sci., 2011

Parameterized complexity of coloring problems: Treewidth versus vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Approximation of minimum weight spanners for sparse graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

Theor. Comput. Sci., 2011

Approximating Width Parameters of Hypergraphs with Excluded Minors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Contraction obstructions for treewidth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Spanners in sparse graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

J. Comput. Syst. Sci., 2011

Spanners of bounded degree graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Lift Contractions.

[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

Branch and Recharge: Exact Algorithms for Generalized Domination.

[BibT_eX]

[DOI]

Algorithmica, 2011

How to Guard a Graph?

[BibT_eX]

[DOI]

Algorithmica, 2011

Contracting a Chordal Graph to a Split Graph or a Tree.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 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

2010

Pursuing a fast robber on a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Intractability of Clique-Width Parameterizations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Parameterized algorithm for eternal vertex cover.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Complexity of the packing coloring problem for trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Approximation Algorithms for Domination Search.

[BibT_eX]

[DOI]

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

L(2, 1, 1)-Labeling Is NP-Complete for Trees.

[BibT_eX]

[DOI]

Bernard Lidický

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

On Coloring Graphs without Induced Forests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Sort and Search: Exact algorithms for generalized domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

The capture time of a graph.

[BibT_eX]

[DOI]

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

Clique-width: on the price of generality.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Choosability of P5-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Three Complexity Results on Coloring Pk-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 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

Parameterized Complexity for Domination Problems on Degenerate Graphs.

[BibT_eX]

[DOI]

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

Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

Distance Constrained Labelings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

On tractability of Cops and Robbers game.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Backbone colorings for graphs: Tree and path backbones.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs.

[BibT_eX]

[DOI]

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

2005

Distance Constrained Labelings of Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Elegant Distance Constrained Labelings of Trees.

[BibT_eX]

[DOI]

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

2003

Interval degree and bandwidth of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Backbone Colorings for Networks.

[BibT_eX]

[DOI]

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

2000

Graph Searching and Interval Completion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

1998

Interval Completion with the Smallest Max-degree.

[BibT_eX]

[DOI]