Fedor V. Fomin

Pekka Parviainen

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

Tree Containment Above Minimum Degree is FPT.

[BibT_eX]

[DOI]

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

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

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

[BibT_eX]

[DOI]

Comput. Sci. Rev., May, 2023

On the optimality of pseudo-polynomial algorithms for integer programming.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Building large k-cores from sparse graphs.

[BibT_eX]

[DOI]

Danil Sagunov

J. Comput. Syst. Sci., 2023

Parameterized complexity of categorical clustering with size constraints.

[BibT_eX]

[DOI]

Nidhi Purohit

J. Comput. Syst. Sci., 2023

IPEC Nerode Prize 2023.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

IPEC Nerode Prize 2023 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Two-sets cut-uncut on planar graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Turán's Theorem Through Algorithmic Lens.

[BibT_eX]

[DOI]

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

Parameterized Complexity of Broadcasting in Graphs.

[BibT_eX]

[DOI]

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

Proportionally Fair Matching with Multiple Groups.

[BibT_eX]

[DOI]

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

Socially Fair Matching: Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Fixed-Parameter Tractability of Maximum Colored Path and Beyond.

[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

Approximating Long Cycle Above Dirac's Guarantee.

[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

Lossy Kernelization for (Implicit) Hitting Set Problems.

[BibT_eX]

[DOI]

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

Kernelization for Spreading Points.

[BibT_eX]

[DOI]

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

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.

[BibT_eX]

[DOI]

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

Coresets for Clustering in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Tanmay Inamdar

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

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

[BibT_eX]

[DOI]

Giannos Stamoulis

ACM Trans. Comput. Theory, December, 2022

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

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2022

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

On the Parameterized Complexity of the Expected Coverage Problem.

[BibT_eX]

[DOI]

Vijayaragunathan Ramamoorthi

Theory Comput. Syst., 2022

Present-biased optimization.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2022

(Re)packing Equal Disks into Rectangle.

[BibT_eX]

[DOI]

CoRR, 2022

Boolean and Fp-Matrix Factorization: From Theory to Practice.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Tree Decompositions with Small Independence Number.

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Complexity of Directed Spanner Problems.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fast FPT-approximation of branchwidth.

[BibT_eX]

[DOI]

Tuukka Korhonen

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 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

Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 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

Inconsistent Planning: When in Doubt, Toss a Coin!

[BibT_eX]

[DOI]

Yuriy Dementiev

Artur Ignatiev

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Multiplicative Parameterization Above a Guarantee.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Preface to the special issue on Graph Searching: Theory and Applications.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Nancy E. Clarke

Archontia C. Giannopoulou

Roman Rabinovich

Theor. Comput. Sci., 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

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 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

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

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

Parameterized Complexity of Feature Selection for Categorical Data Clustering.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Mohsen Alambardar Meybodi

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 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

On the parameterized complexity of [1, j]-domination problems.

[BibT_eX]

[DOI]

Amer E. Mouawad

Fahad Panolan

Theor. Comput. Sci., 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

Path Contraction Faster than 2n.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Bidimensionality and Kernels.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

CSR 2018 Special Issue on TOCS.

[BibT_eX]

[DOI]

Vladimir V. Podolskii

Theory Comput. Syst., 2020

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Parameterized low-rank binary matrix approximation.

[BibT_eX]

[DOI]

Fahad Panolan

Data Min. Knowl. Discov., 2020

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

CoRR, 2020

Subgraph Complementation.

[BibT_eX]

[DOI]

Algorithmica, 2020

On the Tractability of Optimization Problems on H-Graphs.

[BibT_eX]

[DOI]

Jean-Florent Raymond

Algorithmica, 2020

Knot Diagrams of Treewidth Two.

[BibT_eX]

[DOI]

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

Parameterized Complexity of PCA (Invited Talk).

[BibT_eX]

[DOI]

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

Hitting topological minors is FPT.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs.

[BibT_eX]

[DOI]

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

Building Large k-Cores from Sparse Graphs.

[BibT_eX]

[DOI]

Danil Sagunov

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Diverse Pairs of Matchings.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and 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

Time-Inconsistent Planning: Simple Motivation Is Hard to Find.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Editing to Connected F-Degree Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Finding Detours is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

On width measures and topological problems on semi-complete digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

Exact Algorithms via Monotone Local Search.

[BibT_eX]

[DOI]

J. ACM, 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

[BibT_eX]

[DOI]

CoRR, 2019

Parameterized k-Clustering: The distance matters!

[BibT_eX]

[DOI]

CoRR, 2019

A Fixed-Parameter Perspective on #BIS.

[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

Refined Complexity of PCA with Outliers.

[BibT_eX]

[DOI]

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

Decomposition of Map Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 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

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

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Subexponential Parameterized Algorithm for Interval Completion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Exact Algorithms for Terrain Guarding.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 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

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.

[BibT_eX]

[DOI]

J. ACM, 2018

Long directed (s, t)-path: FPT algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin.

[BibT_eX]

[DOI]

Algorithmica, 2018

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.

[BibT_eX]

[DOI]

Algorithmica, 2018

Partial Complementation of Graphs.

[BibT_eX]

[DOI]

Mohsen Alambardar Meybodi

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

On the Parameterized Complexity of [1, j]-Domination Problems.

[BibT_eX]

[DOI]

Amer E. Mouawad

Fahad Panolan

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

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Representative Families of Product Families.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

Faster exact algorithms for some terminal set problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Tight Lower Bounds on Graph Embedding Problems.

[BibT_eX]

[DOI]

J. ACM, 2017

The EATCS Award 2017 - Laudatio for Eva Tardos.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Jean-Eric Pin

Bull. EATCS, 2017

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Parameterized Complexity of Superstring Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Branchwidth of Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Bidimensionality.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Subexponential Parameterized Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

The Firefighter problem on graph classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

Nicolas Nisse

Theor. Comput. Sci., 2016

Hitting Forbidden Minors: Approximation and Kernelization.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

A ck n 5-Approximation Algorithm for Treewidth.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

(Meta) Kernelization.

[BibT_eX]

[DOI]

J. ACM, 2016

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

[BibT_eX]

[DOI]

Rajesh Chitnis

Inf. Comput., 2016

How to hunt an invisible rabbit on a graph.

[BibT_eX]

[DOI]

Tatjana V. Abramovskaya

Eur. J. Comb., 2016

The EATCS Award 2017 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

[BibT_eX]

[DOI]

CoRR, 2016

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n.

[BibT_eX]

[DOI]

Algorithmica, 2016

Vertex Cover Structural Parameterization Revisited.

[BibT_eX]

[DOI]

Fernando Sánchez Villaamil

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

Kernelization and Sparseness: the Case of Dominating Set.

[BibT_eX]

[DOI]

Pål Grønås Drange

Markus Sortland Dregi

Sebastian Siebertz

Somnath Sikdar

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Graph Decompositions and Algorithms (Invited Talk).

[BibT_eX]

[DOI]

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

2015

Exploring the Subexponential Complexity of Completion Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A Subexponential Parameterized Algorithm for Proper Interval Completion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Large Induced Subgraphs via Triangulations and CMSO.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Minimizing Rosenthal Potential in Multicast Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

40th international colloquium on automata, languages and programming.

[BibT_eX]

[DOI]

Marta Z. Kwiatkowska

David Peleg

Inf. Comput., 2015

EATCS Award 2015.

[BibT_eX]

[DOI]

Kim Larsen

Vladimiro Sassone

Bull. EATCS, 2015

Tight Bounds for Subgraph Isomorphism and Graph Homomorphism.

[BibT_eX]

[DOI]

CoRR, 2015

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.

[BibT_eX]

[DOI]

Geevarghese Philip

Algorithmica, 2015

Computing Tree-Depth Faster Than 2n.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

Algorithmica, 2015

Solving d-SAT via Backdoors to Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Metric Dimension of Bounded Width Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Lower Bounds for the Graph Homomorphism Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Graph Modification Problems: A Modern Perspective.

[BibT_eX]

[DOI]

Neeldhara Misra

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Parameterized Algorithms

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-21275-3, 2015

2014

To satisfy impatient Web surfers is hard.

[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

Searching for better fill-in.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Preprocessing subgraph and minor problems: When does a small vertex cover help?

[BibT_eX]

[DOI]

Bart M. P. Jansen

J. Comput. Syst. Sci., 2014

Parameterized complexity of connected even/odd subgraph problems.

[BibT_eX]

[DOI]

Fernando Sánchez Villaamil

J. Comput. Syst. Sci., 2014

Parameterized complexity of firefighting.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Kernelization and Sparseness: the case of Dominating Set.

[BibT_eX]

[DOI]

Somnath Sikdar

CoRR, 2014

Enumerating Minimal Subset Feedback Vertex Sets.

[BibT_eX]

[DOI]

Algorithmica, 2014

Exploring Subexponential Parameterized Complexity of Completion Problems.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Representative Sets of Product Families.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Kernelization Methods for Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Distortion is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2013

A Polynomial Kernel for Proper Interval Vertex Deletion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Subexponential Parameterized Algorithm for Minimum Fill-In.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

A linear vertex kernel for maximum internal spanning tree.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Three complexity results on coloring Pk-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

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

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Dagstuhl Reports, 2013

A O(c^k n) 5-Approximation Algorithm for Treewidth

[BibT_eX]

[DOI]

CoRR, 2013

Exact exponential algorithms.

[BibT_eX]

[DOI]

Petteri Kaski

Commun. ACM, 2013

Computing Optimal Steiner Trees in Polynomial Space.

[BibT_eX]

[DOI]

Algorithmica, 2013

Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.

[BibT_eX]

[DOI]

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

Tight bounds for Parameterized Complexity of Cluster Editing.

[BibT_eX]

[DOI]

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

Jungles, bundles, and fixed parameter tractability.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Computing Tree-Depth Faster Than 2 n.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

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

An O(c^k n) 5-Approximation Algorithm for Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Largest Chordal and Interval Subgraphs Faster Than 2 n.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 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

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

Kernel(s) for problems with no kernel: On out-trees with many leaves.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

ACM Trans. Algorithms, 2012

Cops and Robber with Constraints.

[BibT_eX]

[DOI]

Pawel Pralat

SIAM J. Discret. Math., 2012

Counting Subgraphs via Homomorphisms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Cops and Robber Game Without Recharging.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Faster algorithms for finding and counting subgraphs.

[BibT_eX]

[DOI]

B. V. Raghavendra Rao

J. Comput. Syst. Sci., 2012

Local search: Is brute-force avoidable?

[BibT_eX]

[DOI]

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

Planar F-Deletion: Approximation and Optimal FPT Algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Treewidth computation and extremal combinatorics.

[BibT_eX]

[DOI]

Comb., 2012

Sharp Separation and Applications to Exact and Parameterized Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

Algorithmica, 2012

Fast Minor Testing in Planar Graphs.

[BibT_eX]

[DOI]

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

Bidimensionality and geometric graphs.

[BibT_eX]

[DOI]

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

k-Gap Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Making Life Easier for Firefighters.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

FPT Suspects and Tough Customers: Open Problems of Downey and Fellows.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

An exact algorithm for minimum distortion embedding.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Guard games on graphs: Keep the intruder out!

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2011

Approximation of minimum weight spanners for sparse graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

Theor. Comput. Sci., 2011

Faster parameterized algorithms for minor containment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

On the complexity of reconstructing H-free graphs from their Star Systems.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Contraction obstructions for treewidth.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2011

Spanners in sparse graphs.

[BibT_eX]

[DOI]

Feodor F. Dragan

J. Comput. Syst. Sci., 2011

Kernels for feedback arc set in tournaments.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Implicit branching and parameterized partial cover problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Subexponential algorithms for partial cover problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Spanners of bounded degree graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

On the complexity of some colorful problems parameterized by treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Special Issue on Parameterized Complexity of Discrete Optimization.

[BibT_eX]

[DOI]

Michael R. Fellows

Gregory Z. Gutin

Discret. Optim., 2011

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

[BibT_eX]

[DOI]

Stephan Kreutzer

Dagstuhl Reports, 2011

Subexponential fixed-parameter tractability of cluster editing

[BibT_eX]

[DOI]

CoRR, 2011

Branch and Recharge: Exact Algorithms for Generalized Domination.

[BibT_eX]

[DOI]

Algorithmica, 2011

How to Guard a Graph?

[BibT_eX]

[DOI]

Algorithmica, 2011

Bidimensionality and EPTAS.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Parameterized Complexity of Firefighting Revisited.

[BibT_eX]

[DOI]

Marek Cygan

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Exact Exponential Algorithms

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-16533-7, 2010

Pursuing a fast robber on a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Iterative compression and exact algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Intractability of Clique-Width Parameterizations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Mixed search number and linear-width of interval and split graphs.

[BibT_eX]

[DOI]

Rodica Mihai

Networks, 2010

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Parameterized algorithm for eternal vertex cover.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

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

[BibT_eX]

[DOI]

Sang-il Oum

Eur. J. Comb., 2010

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.

[BibT_eX]

[DOI]

Algorithmica, 2010

Approximation Algorithms for Domination Search.

[BibT_eX]

[DOI]

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

Finding Induced Subgraphs via Minimal Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 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

Protrusions in Graphs and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Ranking and Drawing in Subexponential Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2010

The Curse of Connectivity: t-Total Vertex (Edge) Cover.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Spanning Directed Trees with Many Leaves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

A measure & conquer approach for the analysis of exact algorithms.

[BibT_eX]

[DOI]

J. ACM, 2009

Sort and Search: Exact algorithms for generalized domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Computing branchwidth via efficient triangulations and blocks.

[BibT_eX]

[DOI]

Frédéric Mazoit

Discret. Appl. Math., 2009

On Two Techniques of Combining Branching and Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2009

Nondeterministic Graph Searching: From Pathwidth to Treewidth.

[BibT_eX]

[DOI]

Nicolas Nisse

Algorithmica, 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.

[BibT_eX]

[DOI]

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

Three Complexity Results on Coloring Pk-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Contraction Bidimensionality: the Accurate Picture.

[BibT_eX]

[DOI]

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

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Exact Algorithms for Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 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

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Exact Algorithms for Treewidth and Minimum Fill-In.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Improved algorithms for feedback vertex set problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Subexponential parameterized algorithms.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees

[BibT_eX]

[DOI]

CoRR, 2008

Parameterized Algorithms for Partial Cover Problems

[BibT_eX]

[DOI]

CoRR, 2008

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2008

Solving Connected Dominating Set Faster than 2 n .

[BibT_eX]

[DOI]

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

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 the Complexity of Reconstructing H -free Graphs from Their Star Systems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

On tractability of Cops and Robbers game.

[BibT_eX]

[DOI]

Jan Kratochvíl

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

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Faster Steiner Tree Computation in Polynomial-Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Johan M. M. van Rooij

Ryan Williams

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Executive Summary - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Kazuo Iwama

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Abstracts Collection - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Kazuo Iwama

Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 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

Exact Algorithms for Graph Homomorphisms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

On self duality of pathwidth in polyhedral graph embeddings.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Backbone colorings for graphs: Tree and path backbones.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Eliminating graphs by means of parallel knock-out schemes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Parameterized Algorithms for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Better Algorithms and Bounds for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Counting Minimum Weighted Dominating Sets.

[BibT_eX]

[DOI]

Alexey A. Stepanov

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Improved Exact Algorithms for Counting 3- and 4-Colorings.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

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

Pathwidth of cubic graphs and exact algorithms.

[BibT_eX]

[DOI]

Kjartan Høie

Inf. Process. Lett., 2006

Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.

[BibT_eX]

[DOI]

Algorithmica, 2006

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

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Measure and conquer: a simple O(20.288n) independent set algorithm.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimal Linear Arrangement of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Finding a Minimum Feedback Vertex Set in Time O (1.7548n).

[BibT_eX]

[DOI]

Serge Gaspers

Artem V. Pyatkin

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Branching and Treewidth Based Exact Algorithms.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Equitable colorings of bounded treewidth graphs.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Theor. Comput. Sci., 2005

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

[BibT_eX]

[DOI]

ACM Trans. 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]

Electron. Notes Discret. Math., 2005

On maximum number of minimal dominating sets in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms.

[BibT_eX]

Bull. EATCS, 2005

Tree decompositions with small cost.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Discret. Appl. Math., 2005

Graph Searching, Elimination Trees, and a Generalization of Bandwidth.

[BibT_eX]

[DOI]

Jan Arne Telle

Algorithmica, 2005

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Measure and Conquer: Domination - A Case Study.

[BibT_eX]

[DOI]

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

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

On distance constrained labeling of disk graphs.

[BibT_eX]

[DOI]

Jirí Fiala

Aleksei V. Fishkin

Theor. Comput. Sci., 2004

Radio Labeling with Preassigned Frequencies.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

Bidimensional Parameters and Local Treewidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Complexity of approximating the oriented diameter of chordal graphs.

[BibT_eX]

[DOI]

Martín Matamala

Ivan Rapaport

J. Graph Theory, 2004

A 3-approximation for the pathwidth of Halin graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Algorithms for graphs with small octopus.

[BibT_eX]

[DOI]

Haiko Müller

Discret. Appl. Math., 2004

Searching expenditure and interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Exact (Exponential) Algorithms for the Dominating Set Problem.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

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

Parallel Knock-Out Schemes in Networks.

[BibT_eX]

[DOI]

Hajo Broersma

Gerhard J. Woeginger

Proceedings of the Mathematical Foundations of Computer Science 2004, 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

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.

[BibT_eX]

[DOI]

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

2003

Pathwidth of Planar and Line Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2003

On the monotonicity of games generated by symmetric submodular functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On the Domination Search Number.

[BibT_eX]

[DOI]

Haiko Müller

Discret. Appl. Math., 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

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

Approximation of pathwidth of outerplanar graphs.

[BibT_eX]

[DOI]

Hans L. Bodlaender

J. Algorithms, 2002

Approximation algorithms for time-dependent orienteering.

[BibT_eX]

[DOI]

Andrzej Lingas

Inf. Process. Lett., 2002

Approximating minimum cocolorings.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Inf. Process. Lett., 2002

More About Subcolorings.

[BibT_eX]

[DOI]

Computing, 2002

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Radio Labeling with Pre-assigned Frequencies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Bilateral Orientations and Domination.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Approximating Minimum Cocolourings.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Online and Offline Distance Constrained Labeling of Disk Graphs.

[BibT_eX]

[DOI]

Jirí Fiala

Aleksei V. Fishkin

Proceedings of the Algorithms, 2001

2000

Graph Searching and Interval Completion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

1999

Note on a Helicopter Search Problem on Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Helicopter Search Problems, Bandwidth and Pathwidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Interval Completion with the Smallest Max-degree.

[BibT_eX]

[DOI]