Fedor V. Fomin

According to our database1, Fedor V. Fomin authored at least 287 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the parameterized complexity of [1, j]-domination problems.
Theor. Comput. Sci., 2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.
ACM Trans. Algorithms, 2020

CSR 2018 Special Issue on TOCS.
Theory Comput. Syst., 2020

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.
Theory Comput. Syst., 2020

Parameterized low-rank binary matrix approximation.
Data Min. Knowl. Discov., 2020

A survey of parameterized algorithms and the complexity of edge modification.
CoRR, 2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Parameterization Above a Multiplicative Guarantee.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.
ACM Trans. Algorithms, 2019

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.
ACM Trans. Algorithms, 2019

Spanning Circuits in Regular Matroids.
ACM Trans. Algorithms, 2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
SIAM J. Discrete Math., 2019

Editing to Connected F-Degree Graph.
SIAM J. Discrete Math., 2019

Finding Detours is Fixed-Parameter Tractable.
SIAM J. Discrete Math., 2019

On width measures and topological problems on semi-complete digraphs.
J. Comb. Theory, Ser. B, 2019

Exact Algorithms via Monotone Local Search.
J. ACM, 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
Discrete & Computational Geometry, 2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041).
Dagstuhl Reports, 2019

Time-inconsistent Planning: Simple Motivation Is Hard to Find.
CoRR, 2019

Low-rank binary matrix approximation in column-sum norm.
CoRR, 2019

Knot Diagrams of Treewidth Two.
CoRR, 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.
CoRR, 2019

Parameterized k-Clustering: The distance matters!
CoRR, 2019

A Fixed-Parameter Perspective on #BIS.
Algorithmica, 2019

Kernelization of Graph Hamiltonicity: Proper H-Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Modification to Planarity is Fixed Parameter Tractable.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Refined Complexity of PCA with Outliers.
Proceedings of the 36th International Conference on Machine Learning, 2019

Decomposition of Map Graphs with Applications.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Path Contraction Faster Than 2n.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Parameterized k-Clustering: Tractability Island.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Going Far From Degeneracy.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors.
ACM Trans. Algorithms, 2018

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.
ACM Trans. Algorithms, 2018

Subexponential Parameterized Algorithm for Interval Completion.
ACM Trans. Algorithms, 2018

Exact Algorithms for Terrain Guarding.
ACM Trans. Algorithms, 2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.
SIAM J. Discrete Math., 2018

Structured Connectivity Augmentation.
SIAM J. Discrete Math., 2018

Covering Vectors by Spaces: Regular Matroids.
SIAM J. Discrete Math., 2018

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.
J. ACM, 2018

Long directed (s, t)-path: FPT algorithm.
Inf. Process. Lett., 2018

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

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

Partial Complementation of Graphs.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

On the Parameterized Complexity of [1, j]-Domination Problems.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

On the Optimality of Pseudo-polynomial Algorithms for Integer Programming.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

On the Tractability of Optimization Problems on H-Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Representative Families of Product Families.
ACM Trans. Algorithms, 2017

Metric Dimension of Bounded Tree-length Graphs.
SIAM J. Discrete Math., 2017

Parameterized Complexity of Secluded Connectivity Problems.
Theory Comput. Syst., 2017

Faster exact algorithms for some terminal set problems.
J. Comput. Syst. Sci., 2017

Tight Lower Bounds on Graph Embedding Problems.
J. ACM, 2017

The EATCS Award 2017 - Laudatio for Eva Tardos.
Bulletin of the EATCS, 2017

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).
Dagstuhl Reports, 2017

Parameterized Complexity of Superstring Problems.
Algorithmica, 2017

2016
Branchwidth of Graphs.
Encyclopedia of Algorithms, 2016

Bidimensionality.
Encyclopedia of Algorithms, 2016

Subexponential Parameterized Algorithms.
Encyclopedia of Algorithms, 2016

The Firefighter problem on graph classes.
Theor. Comput. Sci., 2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2016

Hitting Forbidden Minors: Approximation and Kernelization.
SIAM J. Discrete Math., 2016

A ck n 5-Approximation Algorithm for Treewidth.
SIAM J. Comput., 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.
J. ACM, 2016

(Meta) Kernelization.
J. ACM, 2016

Parameterized complexity of the anchored k-core problem for directed graphs.
Inf. Comput., 2016

How to hunt an invisible rabbit on a graph.
Eur. J. Comb., 2016

The EATCS Award 2017 - Call for Nominations.
Bulletin of the EATCS, 2016

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

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

Vertex Cover Structural Parameterization Revisited.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Kernelization and Sparseness: the Case of Dominating Set.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Graph Decompositions and Algorithms (Invited Talk).
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Exploring the Subexponential Complexity of Completion Problems.
TOCT, 2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Theor. Comput. Sci., 2015

A Subexponential Parameterized Algorithm for Proper Interval Completion.
SIAM J. Discrete Math., 2015

Large Induced Subgraphs via Triangulations and CMSO.
SIAM J. Comput., 2015

Minimizing Rosenthal Potential in Multicast Games.
Theory Comput. Syst., 2015

40th international colloquium on automata, languages and programming.
Inf. Comput., 2015

EATCS Award 2015.
Bulletin of the EATCS, 2015

Tight Bounds for Subgraph Isomorphism and Graph Homomorphism.
CoRR, 2015

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

Computing Tree-Depth Faster Than 2n.
Algorithmica, 2015

Solving d-SAT via Backdoors to Small Treewidth.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Metric Dimension of Bounded Width Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Lower Bounds for the Graph Homomorphism Problem.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Graph Modification Problems: A Modern Perspective.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

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

2014
To satisfy impatient Web surfers is hard.
Theor. Comput. Sci., 2014

Long Circuits and Large Euler Subgraphs.
SIAM J. Discrete Math., 2014

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width.
SIAM J. Comput., 2014

Searching for better fill-in.
J. Comput. Syst. Sci., 2014

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.
J. Comput. Syst. Sci., 2014

Preprocessing subgraph and minor problems: When does a small vertex cover help?
J. Comput. Syst. Sci., 2014

Parameterized complexity of connected even/odd subgraph problems.
J. Comput. Syst. Sci., 2014

Parameterized complexity of firefighting.
J. Comput. Syst. Sci., 2014

Kernelization and Sparseness: the case of Dominating Set.
CoRR, 2014

Enumerating Minimal Subset Feedback Vertex Sets.
Algorithmica, 2014

Exploring Subexponential Parameterized Complexity of Completion Problems.
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.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Parameterized Algorithms to Preserve Connectivity.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Connecting Vertices by Independent Trees.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Representative Sets of Product Families.
Proceedings of the Algorithms - ESA 2014, 2014

Kernelization Methods for Fixed-Parameter Tractability.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
Distortion is Fixed Parameter Tractable.
TOCT, 2013

A Polynomial Kernel for Proper Interval Vertex Deletion.
SIAM J. Discrete Math., 2013

Subexponential Parameterized Algorithm for Minimum Fill-In.
SIAM J. Comput., 2013

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

A linear vertex kernel for maximum internal spanning tree.
J. Comput. Syst. Sci., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.
Inf. Comput., 2013

Three complexity results on coloring Pk-free graphs.
Eur. J. Comb., 2013

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

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

Exact exponential algorithms.
Commun. ACM, 2013

Computing Optimal Steiner Trees in Polynomial Space.
Algorithmica, 2013

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

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Tight bounds for Parameterized Complexity of Cluster Editing.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Jungles, bundles, and fixed parameter tractability.
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.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Computing Tree-Depth Faster Than 2 n.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

An O(c^k n) 5-Approximation Algorithm for Treewidth.
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.
Proceedings of the Algorithms - ESA 2013, 2013

Largest Chordal and Interval Subgraphs Faster Than 2 n.
Proceedings of the Algorithms - ESA 2013, 2013

Preventing Unraveling in Social Networks Gets Harder.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Foreword: Special Issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2012

On exact algorithms for treewidth.
ACM Trans. Algorithms, 2012

Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms, 2012

Cops and Robber with Constraints.
SIAM J. Discrete Math., 2012

Counting Subgraphs via Homomorphisms.
SIAM J. Discrete Math., 2012

Cops and Robber Game Without Recharging.
Theory Comput. Syst., 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.
Theory Comput. Syst., 2012

Faster algorithms for finding and counting subgraphs.
J. Comput. Syst. Sci., 2012

Local search: Is brute-force avoidable?
J. Comput. Syst. Sci., 2012

Catalan structures and dynamic programming in H-minor-free graphs.
J. Comput. Syst. Sci., 2012

Connected graph searching.
Inf. Comput., 2012

Planar F-Deletion: Approximation and Optimal FPT Algorithms
CoRR, 2012

Treewidth computation and extremal combinatorics.
Combinatorica, 2012

Sharp Separation and Applications to Exact and Parameterized Algorithms.
Algorithmica, 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.
Algorithmica, 2012

Fast Minor Testing in Planar Graphs.
Algorithmica, 2012

Linear kernels for (connected) dominating set on H-minor-free graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Bidimensionality and geometric graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Making Life Easier for Firefighters.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

FPT Suspects and Tough Customers: Open Problems of Downey and Fellows.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
An exact algorithm for minimum distortion embedding.
Theor. Comput. Sci., 2011

Guard games on graphs: Keep the intruder out!
Theor. Comput. Sci., 2011

Special Issue on "Theory and Applications of Graph Searching Problems".
Theor. Comput. Sci., 2011

Approximation of minimum weight spanners for sparse graphs.
Theor. Comput. Sci., 2011

Faster parameterized algorithms for minor containment.
Theor. Comput. Sci., 2011

Approximating Width Parameters of Hypergraphs with Excluded Minors.
SIAM J. Discrete Math., 2011

Strengthening Erdös-Pósa property for minor-closed graph classes.
Journal of Graph Theory, 2011

On the complexity of reconstructing H-free graphs from their Star Systems.
Journal of Graph Theory, 2011

Contraction obstructions for treewidth.
J. Comb. Theory, Ser. B, 2011

Spanners in sparse graphs.
J. Comput. Syst. Sci., 2011

Kernels for feedback arc set in tournaments.
J. Comput. Syst. Sci., 2011

Implicit branching and parameterized partial cover problems.
J. Comput. Syst. Sci., 2011

Subexponential algorithms for partial cover problems.
Inf. Process. Lett., 2011

Spanners of bounded degree graphs.
Inf. Process. Lett., 2011

On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput., 2011

Special Issue on Parameterized Complexity of Discrete Optimization.
Discret. Optim., 2011

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

Subexponential fixed-parameter tractability of cluster editing
CoRR, 2011

Branch and Recharge: Exact Algorithms for Generalized Domination.
Algorithmica, 2011

How to Guard a Graph?
Algorithmica, 2011

Bidimensionality and EPTAS.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Parameterized Complexity of Firefighting Revisited.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.
Proceedings of the Algorithms - ESA 2011, 2011

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

Pursuing a fast robber on a graph.
Theor. Comput. Sci., 2010

Iterative compression and exact algorithms.
Theor. Comput. Sci., 2010

Intractability of Clique-Width Parameterizations.
SIAM J. Comput., 2010

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

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
J. Comput. Syst. Sci., 2010

Parameterized algorithm for eternal vertex cover.
Inf. Process. Lett., 2010

Rank-width and tree-width of H-minor-free graphs.
Eur. J. Comb., 2010

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

Approximation Algorithms for Domination Search.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Finding Induced Subgraphs via Minimal Triangulations.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Bidimensionality and Kernels.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Protrusions in Graphs and Their Applications.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Ranking and Drawing in Subexponential Time.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Kernelization.
Proceedings of the Computer Science, 2010

The Curse of Connectivity: t-Total Vertex (Edge) Cover.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Spanning Directed Trees with Many Leaves.
SIAM J. Discrete Math., 2009

A measure & conquer approach for the analysis of exact algorithms.
J. ACM, 2009

Sort and Search: Exact algorithms for generalized domination.
Inf. Process. Lett., 2009

Computing branchwidth via efficient triangulations and blocks.
Discret. Appl. Math., 2009

On Two Techniques of Combining Branching and Treewidth.
Algorithmica, 2009

Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica, 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Approximating Acyclicity Parameters of Sparse Hypergraphs.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Clique-width: on the price of generality.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Three Complexity Results on Coloring Pk-Free Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Contraction Bidimensionality: the Accurate Picture.
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.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Exact Algorithms for Dominating Set.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Branchwidth of Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An annotated bibliography on guaranteed graph searching.
Theor. Comput. Sci., 2008

Forewords: Special issue on graph searching.
Theor. Comput. Sci., 2008

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
ACM Trans. Algorithms, 2008

Exact Algorithms for Treewidth and Minimum Fill-In.
SIAM J. Comput., 2008

Improved algorithms for feedback vertex set problems.
J. Comput. Syst. Sci., 2008

Subexponential parameterized algorithms.
Comput. Sci. Rev., 2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR, 2008

Parameterized Algorithms for Partial Cover Problems
CoRR, 2008

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

Solving Connected Dominating Set Faster than 2 n .
Algorithmica, 2008

Catalan structures and dynamic programming in H-minor-free graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

On the Complexity of Reconstructing H -free Graphs from Their Star Systems.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

On tractability of Cops and Robbers game.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Faster Steiner Tree Computation in Polynomial-Space.
Proceedings of the Algorithms, 2008

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

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

08431 Abstracts Collection - Moderately Exponential Time Algorithms.
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.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Exact Algorithms for Graph Homomorphisms.
Theory Comput. Syst., 2007

On self duality of pathwidth in polyhedral graph embeddings.
Journal of Graph Theory, 2007

Backbone colorings for graphs: Tree and path backbones.
Journal of Graph Theory, 2007

Eliminating graphs by means of parallel knock-out schemes.
Discret. Appl. Math., 2007

Parameterized Algorithms for Directed Maximum Leaf Problems.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Better Algorithms and Bounds for Directed Maximum Leaf Problems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Counting Minimum Weighted Dominating Sets.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Improved Exact Algorithms for Counting 3- and 4-Colorings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.
SIAM J. Comput., 2006

New upper bounds on the decomposability of planar graphs.
Journal of Graph Theory, 2006

Pathwidth of cubic graphs and exact algorithms.
Inf. Process. Lett., 2006

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

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
Proceedings of the Algorithm Theory, 2006

Measure and conquer: a simple O(20.288n) independent set algorithm.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Optimal Linear Arrangement of Interval Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Branching and Treewidth Based Exact Algorithms.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
Equitable colorings of bounded treewidth graphs.
Theor. Comput. Sci., 2005

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

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM, 2005

Connected Graph Searching in Outerplanar Graphs.
Electron. Notes Discret. Math., 2005

On maximum number of minimal dominating sets in graphs.
Electron. Notes Discret. Math., 2005

Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms.
Bulletin of the EATCS, 2005

Tree decompositions with small cost.
Discret. Appl. Math., 2005

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

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Measure and Conquer: Domination - A Case Study.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
Proceedings of the Algorithms, 2005

2004
On distance constrained labeling of disk graphs.
Theor. Comput. Sci., 2004

Radio Labeling with Preassigned Frequencies.
SIAM Journal on Optimization, 2004

Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math., 2004

Complexity of approximating the oriented diameter of chordal graphs.
Journal of Graph Theory, 2004

A 3-approximation for the pathwidth of Halin graphs.
Electron. Notes Discret. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.
Discret. Appl. Math., 2004

Algorithms for graphs with small octopus.
Discret. Appl. Math., 2004

Searching expenditure and interval graphs.
Discret. Appl. Math., 2004

Exact (Exponential) Algorithms for the Dominating Set Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

A Simple and Fast Approach for Solving Problems on Planar Graphs.
Proceedings of the STACS 2004, 2004

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Parallel Knock-Out Schemes in Networks.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Pathwidth of Planar and Line Graphs.
Graphs and Combinatorics, 2003

On the monotonicity of games generated by symmetric submodular functions.
Discret. Appl. Math., 2003

On the Domination Search Number.
Discret. Appl. Math., 2003

Interval degree and bandwidth of a graph.
Discret. Appl. Math., 2003

Backbone Colorings for Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dominating Sets and Local Treewidth.
Proceedings of the Algorithms, 2003

2002
Approximation of pathwidth of outerplanar graphs.
J. Algorithms, 2002

Approximation algorithms for time-dependent orienteering.
Inf. Process. Lett., 2002

Approximating minimum cocolorings.
Inf. Process. Lett., 2002

More About Subcolorings.
Computing, 2002

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
Proceedings of the Algorithm Theory, 2002

Radio Labeling with Pre-assigned Frequencies.
Proceedings of the Algorithms, 2002

2001
Bilateral Orientations and Domination.
Electron. Notes Discret. Math., 2001

Approximating Minimum Cocolourings.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Online and Offline Distance Constrained Labeling of Disk Graphs.
Proceedings of the Algorithms, 2001

2000
Graph Searching and Interval Completion.
SIAM J. Discrete Math., 2000

1999
Note on a Helicopter Search Problem on Graphs.
Discret. Appl. Math., 1999

1998
Helicopter Search Problems, Bandwidth and Pathwidth.
Discret. Appl. Math., 1998

Interval Completion with the Smallest Max-degree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998


  Loading...