| Publication | Date of Publication | Type |
|---|
Computing paths of large rank in planar frameworks deterministically
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
Polynomial-time approximation of independent set parameterized by treewidth
| 2025-01-06 | Paper |
Kernelization for spreading points
| 2025-01-06 | Paper |
Lossy kernelization for (implicit) hitting set problems
| 2025-01-06 | Paper |
FPT approximation and subexponential algorithms for covering few or many edges
| 2024-12-03 | Paper |
Tree containment above minimum degree is FPT
| 2024-11-28 | Paper |
(Re)packing equal disks into rectangle
Discrete \& Computational Geometry | 2024-11-22 | Paper |
Compound logics for modification problems
| 2024-11-14 | Paper |
Approximating long cycle above Dirac's guarantee
| 2024-11-14 | Paper |
Longest cycle above Erdős-Gallai bound
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
Coresets for clustering in geometric intersection graphs
| 2024-10-16 | Paper |
Parameterized and approximation algorithms for the maximum bimodal subgraph problem
| 2024-10-14 | Paper |
Fast FPT-approximation of branchwidth
SIAM Journal on Computing | 2024-08-27 | Paper |
Approximating long cycle above Dirac's guarantee
Algorithmica | 2024-08-13 | Paper |
Long cycles in graphs: extremal combinatorics meets parameterized algorithms (invited talk)
| 2024-08-06 | Paper |
Algorithmic extensions of Dirac's theorem
| 2024-07-19 | Paper |
(Re)packing equal disks into rectangle
| 2024-06-24 | Paper |
Diverse pairs of matchings
Algorithmica | 2024-05-30 | Paper |
Shortest cycles with monotone submodular costs
| 2024-05-14 | Paper |
Fixed-parameter tractability of maximum colored path and beyond
| 2024-05-14 | Paper |
Proportionally Fair Matching with Multiple Groups
| 2024-05-03 | Paper |
Parameterized Complexity of Broadcasting in Graphs
| 2024-05-03 | Paper |
Turán’s Theorem Through Algorithmic Lens
| 2024-05-03 | Paper |
Detours in directed graphs
| 2024-04-23 | Paper |
Parameterized complexity of broadcasting in graphs
Theoretical Computer Science | 2024-04-16 | Paper |
FPT approximation and subexponential algorithms for covering few or many edges
Information Processing Letters | 2024-03-13 | Paper |
On coresets for fair clustering in metric and Euclidean spaces and their applications
Journal of Computer and System Sciences | 2024-03-11 | Paper |
Diverse collections in matroids and graphs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
scientific article; zbMATH DE number 7799599 (Why is no real title available?)
| 2024-02-05 | Paper |
Socially fair matching: exact and approximation algorithms
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788495 (Why is no real title available?)
| 2024-01-15 | Paper |
Fast FPT-approximation of branchwidth
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Diverse Pairs of Matchings
| 2023-11-14 | Paper |
Parameterized Complexity of Directed Spanner Problems.
| 2023-11-13 | Paper |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7759269 (Why is no real title available?)
| 2023-11-02 | Paper |
Low-Rank Binary Matrix Approximation in Column-Sum Norm.
| 2023-10-31 | Paper |
How to find a good explanation for clustering?
Artificial Intelligence | 2023-08-28 | Paper |
Lossy kernelization of same-size clustering
Theory of Computing Systems | 2023-08-17 | Paper |
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
| 2023-08-08 | Paper |
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
Information and Computation | 2023-07-17 | Paper |
Detours in directed graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
A survey of parameterized algorithms and the complexity of edge modification
Computer Science Review | 2023-06-20 | Paper |
Parameterized complexity of categorical clustering with size constraints
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
SIAM Journal on Computing | 2023-04-04 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
scientific article; zbMATH DE number 7651188 (Why is no real title available?)
| 2023-02-07 | Paper |
On the Complexity of Recovering Incidence Matrices
| 2023-02-07 | Paper |
Kernelization of Whitney Switches
| 2023-02-07 | Paper |
An algorithmic meta-theorem for graph modification to planarity and FOL
| 2023-02-07 | Paper |
Parameterized k-Clustering: Tractability Island
| 2023-02-03 | Paper |
Parameterization Above a Multiplicative Guarantee
| 2023-02-03 | Paper |
Building large \(k\)-cores from sparse graphs
Journal of Computer and System Sciences | 2023-01-09 | Paper |
Knot diagrams of treewidth two
| 2022-12-21 | Paper |
Lossy kernelization of same-size clustering
| 2022-11-11 | Paper |
On the Parameterized Complexity of the Expected Coverage Problem
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Present-biased optimization
Mathematical Social Sciences | 2022-10-04 | Paper |
Multiplicative Parameterization Above a Guarantee
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
On the Parameterized Complexity of [1,j-Domination Problems]
| 2022-07-21 | Paper |
Path Contraction Faster Than 2^n
| 2022-07-21 | Paper |
Decomposition of Map Graphs with Applications.
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561552 (Why is no real title available?)
| 2022-07-21 | Paper |
Computing Tree Decompositions with Small Independence Number
| 2022-07-20 | Paper |
Building large \(k\)-cores from sparse graphs
| 2022-07-18 | Paper |
Modification to Planarity is Fixed Parameter Tractable
| 2022-07-18 | Paper |
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
| 2022-06-08 | Paper |
ETH-tight algorithms for long path and cycle on unit disk graphs
| 2022-05-18 | Paper |
scientific article; zbMATH DE number 7525484 (Why is no real title available?)
| 2022-05-11 | Paper |
On the parameterized complexity of the expected coverage problem
Theory of Computing Systems | 2022-05-09 | Paper |
Parameterized complexity of elimination distance to first-order logic properties
ACM Transactions on Computational Logic | 2022-04-29 | Paper |
Parameterized complexity of categorical clustering with size constraints
| 2022-03-25 | Paper |
Computation of Hadwiger number and related contraction problems. Tight lower bounds
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Longest Cycle above Erd\H{o}s-Gallai Bound
| 2022-02-07 | Paper |
Parameterized Algorithms
| 2022-02-04 | Paper |
Compound Logics for Modification Problems
| 2021-11-04 | Paper |
scientific article; zbMATH DE number 7378700 (Why is no real title available?)
| 2021-08-04 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
| 2021-08-04 | Paper |
Parameterized low-rank binary matrix approximation
| 2021-07-28 | Paper |
Subexponential parameterized algorithms and kernelization on almost chordal graphs
Algorithmica | 2021-06-30 | Paper |
Kernelization of Whitney switches
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
Parameterized \(k\)-clustering: tractability island
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hitting topological minors is FPT
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Parameterized low-rank binary matrix approximation
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
Bidimensionality and kernels
SIAM Journal on Computing | 2021-01-13 | Paper |
Going far from degeneracy
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
On the tractability of optimization problems on \(H\)-graphs
Algorithmica | 2020-09-03 | Paper |
Partial complementation of graphs
| 2020-08-25 | Paper |
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
| 2020-08-18 | Paper |
Path contraction faster than \(2^n\)
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
Finding detours is fixed-parameter tractable
| 2020-05-27 | Paper |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
| 2020-05-27 | Paper |
Covering vectors by spaces: regular matroids
| 2020-05-27 | Paper |
A fixed-parameter perspective on \#BIS
| 2020-05-27 | Paper |
Structured connectivity augmentation
| 2020-05-26 | Paper |
Subgraph complementation
Algorithmica | 2020-05-21 | Paper |
On the parameterized complexity of graph modification to first-order logic properties
Theory of Computing Systems | 2020-02-27 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
| 2020-01-16 | Paper |
On the parameterized complexity of \([1,j\)-domination problems]
Theoretical Computer Science | 2019-12-27 | Paper |
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Spanning circuits in regular matroids
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Finding detours is fixed-parameter tractable
SIAM Journal on Discrete Mathematics | 2019-11-27 | Paper |
Exact algorithms via monotone local search
Journal of the ACM | 2019-11-21 | Paper |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
Discrete \& Computational Geometry | 2019-11-07 | Paper |
A fixed-parameter perspective on \#BIS
Algorithmica | 2019-09-10 | Paper |
Editing to Connected F-Degree Graph
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
On width measures and topological problems on semi-complete digraphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Efficient computation of representative sets with applications in parameterized and exact algorithms
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Large induced subgraphs via triangulations and CMSO
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Jungles, bundles, and fixed-parameter tractability
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
scientific article; zbMATH DE number 7053376 (Why is no real title available?)
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7053390 (Why is no real title available?)
| 2019-05-10 | Paper |
Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
| 2019-05-10 | Paper |
Clique-width: on the price of generality
| 2019-05-06 | Paper |
Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
SIAM Journal on Discrete Mathematics | 2019-02-06 | Paper |
Kernelization. Theory of parameterized preprocessing
| 2019-01-14 | Paper |
Covering Vectors by Spaces: Regular Matroids
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Structured connectivity augmentation
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Exact algorithms for terrain guarding
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Subexponential parameterized algorithm for {\textsc{Interval Completion}}
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Kernels for (connected) dominating set on graphs with excluded topological minors
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Combinatorial bounds via measure and conquer
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Representative families of product families
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Long directed \((s,t)\)-path: FPT algorithm
Information Processing Letters | 2018-10-19 | Paper |
Exact algorithms for terrain guarding
| 2018-08-13 | Paper |
(Meta) kernelization
Journal of the ACM | 2018-08-02 | Paper |
Efficient computation of representative families with applications in parameterized and exact algorithms
Journal of the ACM | 2018-08-02 | Paper |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Spanning circuits in regular matroids
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Subexponential parameterized algorithm for interval completion
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Algorithmica | 2018-05-23 | Paper |
Tight lower bounds on graph embedding problems
Journal of the ACM | 2018-05-17 | Paper |
Matrix Rigidity from the Viewpoint of Parameterized Complexity
SIAM Journal on Discrete Mathematics | 2018-05-02 | Paper |
Matrix Rigidity from the Viewpoint of Parameterized Complexity
| 2018-04-19 | Paper |
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
| 2018-01-30 | Paper |
Editing to connected \(f\)-degree graph
| 2018-01-24 | Paper |
Parameterized complexity of superstring problems
Algorithmica | 2017-11-09 | Paper |
Parameterized complexity of secluded connectivity problems
Theory of Computing Systems | 2017-10-12 | Paper |
Solving d-SAT via Backdoors to Small Treewidth
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
scientific article; zbMATH DE number 6783430 (Why is no real title available?)
| 2017-09-29 | Paper |
Exact algorithms via monotone local search
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
On the tractability of optimization problems on H-graphs
| 2017-09-27 | Paper |
Parameterized complexity of secluded connectivity problems
| 2017-07-13 | Paper |
Faster exact algorithms for some terminal set problems
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Metric Dimension of Bounded Tree-length Graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
Connecting Vertices by Independent Trees
| 2017-04-25 | Paper |
Exploring subexponential parameterized complexity of completion problems
| 2017-03-03 | Paper |
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
| 2017-02-21 | Paper |
Searching for better fill-in
| 2017-01-30 | Paper |
Tight bounds for parameterized complexity of Cluster Editing
| 2017-01-30 | Paper |
scientific article; zbMATH DE number 6678911 (Why is no real title available?)
| 2017-01-30 | Paper |
Large Induced Subgraphs via Triangulations and CMSO
SIAM Journal on Computing | 2017-01-13 | Paper |
Vertex cover structural parameterization revisited
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Exploring the subexponential complexity of completion problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Largest chordal and interval subgraphs faster than \(2^n\)
Algorithmica | 2016-10-21 | Paper |
A \(c^k n\) 5-approximation algorithm for treewidth
SIAM Journal on Computing | 2016-04-11 | Paper |
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
Information and Computation | 2016-03-10 | Paper |
Hitting forbidden minors: approximation and kernelization
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
The firefighter problem on graph classes
Theoretical Computer Science | 2015-12-28 | Paper |
How to hunt an invisible rabbit on a graph
European Journal of Combinatorics | 2015-12-11 | Paper |
Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
Journal of the ACM | 2015-12-04 | Paper |
A measure \& conquer approach for the analysis of exact algorithms
Journal of the ACM | 2015-11-11 | Paper |
A Subexponential Parameterized Algorithm for Proper Interval Completion
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
Automata, Languages, and Programming | 2015-10-27 | Paper |
Lower bounds for the graph homomorphism problem
Automata, Languages, and Programming | 2015-10-27 | Paper |
Distortion is fixed parameter tractable
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Metric dimension of bounded width graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Minimizing Rosenthal potential in multicast games
Theory of Computing Systems | 2015-09-04 | Paper |
Computing tree-depth faster than \(2^n\)
Algorithmica | 2015-09-03 | Paper |
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Parameterized complexity of superstring problems
Lecture Notes in Computer Science | 2015-08-20 | Paper |
Parameterized algorithms
| 2015-08-17 | Paper |
Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
| 2015-08-03 | Paper |
Minimum fill-in of sparse graphs: kernelization and approximation
Algorithmica | 2015-03-02 | Paper |
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
SIAM Journal on Computing | 2015-02-09 | Paper |
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Theoretical Computer Science | 2014-12-22 | Paper |
On exact algorithms for treewidth
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Enumerating minimal subset feedback vertex sets
Algorithmica | 2014-11-19 | Paper |
Representative sets of product families
Algorithms - ESA 2014 | 2014-10-08 | Paper |
A subexponential parameterized algorithm for proper interval completion
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Subexponential parameterized algorithms
Computer Science Review | 2014-10-07 | Paper |
Long circuits and large Euler subgraphs
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Kernel(s) for problems with no kernel
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Lecture Notes in Computer Science | 2014-09-02 | Paper |
(Meta) Kernelization
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Parameterized algorithms to preserve connectivity
Automata, Languages, and Programming | 2014-07-01 | Paper |
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Searching for better fill-in
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Parameterized complexity of firefighting
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Bidimensionality and kernels
| 2014-05-22 | Paper |
Algorithmic lower bounds for problems parameterized by clique-width
| 2014-05-22 | Paper |
Subexponential parameterized algorithm for minimum fill-in
SIAM Journal on Computing | 2014-04-11 | Paper |
A Polynomial Kernel for Proper Interval Vertex Deletion
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
To satisfy impatient web surfers is hard
Theoretical Computer Science | 2014-03-13 | Paper |
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
Information and Computation | 2014-01-10 | Paper |
Preprocessing subgraph and minor problems: when does a small vertex cover help?
Journal of Computer and System Sciences | 2013-12-13 | Paper |
Computing Tree-Depth Faster Than 2 n
Parameterized and Exact Computation | 2013-12-10 | Paper |
Faster exact algorithms for some terminal set problems
Parameterized and Exact Computation | 2013-12-10 | Paper |
Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
Journal of Graph Theory | 2013-11-15 | Paper |
On the Parameterized Complexity of Cutting a Few Vertices from a Graph
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Largest Chordal and Interval Subgraphs Faster Than 2 n
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Long circuits and large Euler subgraphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Treewidth computation and extremal combinatorics
Combinatorica | 2013-08-06 | Paper |
Computing optimal Steiner trees in polynomial space
Algorithmica | 2013-08-05 | Paper |
Spanners of bounded degree graphs
Information Processing Letters | 2013-04-04 | Paper |
Subexponential algorithms for partial cover problems
Information Processing Letters | 2013-04-04 | Paper |
Exact algorithms for finding longest cycles in claw-free graphs
Algorithmica | 2013-03-05 | Paper |
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Three complexity results on coloring \(P_k\)-free graphs
European Journal of Combinatorics | 2013-01-24 | Paper |
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Parameterized and Exact Computation | 2013-01-07 | Paper |
A note on exact algorithms for vertex ordering problems on graphs
Theory of Computing Systems | 2012-12-06 | Paper |
Cops and robber game without recharging
Theory of Computing Systems | 2012-12-06 | Paper |
Connected graph searching
Information and Computation | 2012-11-27 | Paper |
Parameterized complexity of the spanning tree congestion problem
Algorithmica | 2012-11-21 | Paper |
Fast minor testing in planar graphs
Algorithmica | 2012-11-21 | Paper |
Minimizing Rosenthal potential in multicast games
Automata, Languages, and Programming | 2012-11-01 | Paper |
Kernels for feedback arc set in tournaments
| 2012-10-24 | Paper |
Subexponential algorithms for partial cover problems
| 2012-10-24 | Paper |
Implicit branching and parameterized partial cover problems (extended abstract)
| 2012-10-19 | Paper |
A polynomial kernel for \textsc{Proper Interval Vertex Deletion}
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Counting subgraphs via homomorphisms
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Cops and robber with constraints
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Minimum fill-in of sparse graphs: kernelization and approximation
| 2012-08-31 | Paper |
Parameterized complexity of connected even/odd subgraph problems
| 2012-08-23 | Paper |
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Catalan structures and dynamic programming in \(H\)-minor-free graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Local search: is brute-force avoidable?
Journal of Computer and System Sciences | 2012-08-17 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Parameterized Complexity of Firefighting Revisited
Parameterized and Exact Computation | 2012-06-15 | Paper |
More about subcolorings
Computing | 2012-06-04 | Paper |
Sharp separation and applications to exact and parameterized algorithms
Algorithmica | 2012-04-26 | Paper |
Approximating acyclicity parameters of sparse hypergraphs
| 2012-04-24 | Paper |
\(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
| 2012-04-24 | Paper |
Parameterized algorithm for eternal vertex cover
Information Processing Letters | 2012-03-19 | Paper |
Approximating width parameters of hypergraphs with excluded minors
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Hitting forbidden minors: approximation and kernelization
| 2012-01-23 | Paper |
Finding induced subgraphs via minimal triangulations
| 2012-01-23 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
| 2012-01-23 | Paper |
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Spanners in sparse graphs
Journal of Computer and System Sciences | 2012-01-11 | Paper |
How to guard a graph?
Algorithmica | 2011-12-14 | Paper |
Faster parameterized algorithms for minor containment
Theoretical Computer Science | 2011-12-07 | Paper |
Guard games on graphs: keep the intruder out!
Theoretical Computer Science | 2011-12-07 | Paper |
On the complexity of reconstructing H-free graphs from their Star Systems
Journal of Graph Theory | 2011-10-12 | Paper |
Branch and recharge: exact algorithms for generalized domination
Algorithmica | 2011-09-20 | Paper |
Exact algorithm for the maximum induced planar subgraph problem
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Enumerating minimal subset feedback vertex sets
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Contraction obstructions for treewidth
Journal of Combinatorial Theory. Series B | 2011-08-10 | Paper |
An exact algorithm for minimum distortion embedding
Theoretical Computer Science | 2011-07-14 | Paper |
Ranking and drawing in subexponential time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Strengthening Erdős -- Pósa property for minor-closed graph classes
Journal of Graph Theory | 2011-03-21 | Paper |
On the complexity of some colorful problems parameterized by treewidth
Information and Computation | 2011-02-21 | Paper |
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science | 2011-02-21 | Paper |
Approximation algorithms for domination search
Approximation and Online Algorithms | 2011-02-15 | Paper |
Mixed search number and linear-width of interval and split graphs
Networks | 2010-11-24 | Paper |
Exact exponential algorithms.
Texts in Theoretical Computer Science. An EATCS Series | 2010-11-18 | Paper |
Intractability of clique-width parameterizations
SIAM Journal on Computing | 2010-11-04 | Paper |
Rank-width and tree-width of \(H\)-minor-free graphs
European Journal of Combinatorics | 2010-10-18 | Paper |
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Algorithmica | 2010-09-27 | Paper |
Fast minor testing in planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Sort and Search: exact algorithms for generalized domination
Information Processing Letters | 2010-08-20 | Paper |
Measure and conquer
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764900 (Why is no real title available?)
| 2010-08-06 | Paper |
The curse of connectivity: \(t\)-total vertex (edge) cover
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Faster parameterized algorithms for minor containment
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Cops and Robber game without recharging
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Guard games on graphs: keep the intruder out!
Approximation and Online Algorithms | 2010-05-11 | Paper |
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics | 2010-04-28 | Paper |
Sharp separation and applications to exact and parameterized algorithms
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Spanning directed trees with many leaves
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Iterative compression and exact algorithms
Theoretical Computer Science | 2010-03-09 | Paper |
Pursuing a fast robber on a graph
Theoretical Computer Science | 2010-03-09 | Paper |
Dominating sets and local treewidth
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fast exact algorithms for Hamiltonicity in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
An exact algorithm for minimum distortion embedding
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Backbone colorings for networks.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters | 2009-12-18 | Paper |
A linear vertex kernel for Maximum Internal Spanning Tree
Algorithms and Computation | 2009-12-17 | Paper |
Three complexity results on coloring \(P _{k }\)-free graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Contraction Bidimensionality: The Accurate Picture
Lecture Notes in Computer Science | 2009-10-29 | Paper |
scientific article; zbMATH DE number 5605070 (Why is no real title available?)
| 2009-09-19 | Paper |
Counting Subgraphs via Homomorphisms
Automata, Languages and Programming | 2009-07-14 | Paper |
Distortion Is Fixed Parameter Tractable
Automata, Languages and Programming | 2009-07-14 | Paper |
On two techniques of combining branching and treewidth
Algorithmica | 2009-06-22 | Paper |
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing | 2009-06-22 | Paper |
Nondeterministic graph searching: from pathwidth to treewidth
Algorithmica | 2009-06-17 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Counting Minimum Weighted Dominating Sets
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Improved Exact Algorithms for Counting 3- and 4-Colorings
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Branch and Recharge: Exact Algorithms for Generalized Domination
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Improved Algorithms for the Feedback Vertex Set Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Iterative Compression and Exact Algorithms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
How to Guard a Graph?
Algorithms and Computation | 2009-01-29 | Paper |
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Algorithmica | 2008-12-02 | Paper |
Solving connected dominating set faster than \(2^n\)
Algorithmica | 2008-12-02 | Paper |
Faster Steiner Tree Computation in Polynomial-Space
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences | 2008-11-19 | Paper |
Treewidth Computation and Extremal Combinatorics
Automata, Languages and Programming | 2008-08-28 | Paper |
Spanners in Sparse Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Mixed Search Number and Linear-Width of Interval and Split Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science | 2008-06-24 | Paper |
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
Parameterized and Exact Computation | 2008-06-03 | Paper |
Branching and Treewidth Based Exact Algorithms
Algorithms and Computation | 2008-04-24 | Paper |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Solving Connected Dominating Set Faster Than 2 n
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
On the Complexity of Reconstructing H-free Graphs from Their Star Systems
Lecture Notes in Computer Science | 2008-04-15 | Paper |
On Exact Algorithms for Treewidth
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Subexponential Parameterized Algorithms
Automata, Languages and Programming | 2007-11-28 | Paper |
Parameterized Algorithms for Directed Maximum Leaf Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Exact algorithms for graph homomorphisms
Theory of Computing Systems | 2007-09-06 | Paper |
Optimal Linear Arrangement of Interval Graphs
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Search in graphs
| 2007-08-21 | Paper |
Backbone colorings for graphs: Tree and path backbones
Journal of Graph Theory | 2007-06-11 | Paper |
On self duality of pathwidth in polyhedral graph embeddings
Journal of Graph Theory | 2007-06-11 | Paper |
On maximum number of minimal dominating sets in graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A 3-approximation for the pathwidth of Halin graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Connected Graph Searching in Outerplanar Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
SIAM Journal on Computing | 2007-05-03 | Paper |
Eliminating graphs by means of parallel knock-out schemes
Discrete Applied Mathematics | 2007-02-19 | Paper |
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
Algorithmica | 2006-08-16 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
New upper bounds on the decomposability of planar graphs
Journal of Graph Theory | 2006-03-24 | Paper |
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Radio Labeling with Preassigned Frequencies
SIAM Journal on Optimization | 2005-02-23 | Paper |
Tree decompositions with small cost
Discrete Applied Mathematics | 2005-02-22 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth
Algorithmica | 2005-02-21 | Paper |
On distance constrained labeling of disk graphs
Theoretical Computer Science | 2005-01-11 | Paper |
Tree Decompositions with Small Cost
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2089219 (Why is no real title available?)
| 2004-08-12 | Paper |
AT-free graphs: Linear bounds for the oriented diameter
Discrete Applied Mathematics | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2079336 (Why is no real title available?)
| 2004-07-28 | Paper |
Complexity of approximating the oriented diameter of chordal graphs
Journal of Graph Theory | 2004-03-29 | Paper |
scientific article; zbMATH DE number 2044933 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2044935 (Why is no real title available?)
| 2004-02-18 | Paper |
On a complementary interval graph with the lowest max-degree
Vestnik St. Petersburg University. Mathematics | 2004-02-09 | Paper |
scientific article; zbMATH DE number 2038758 (Why is no real title available?)
| 2004-02-08 | Paper |
Discrete search programs on graphs
Vestnik St. Petersburg University. Mathematics | 2004-01-29 | Paper |
Algorithms for graphs with small octopus
Discrete Applied Mathematics | 2004-01-26 | Paper |
On the monotonicity of games generated by symmetric submodular functions.
Discrete Applied Mathematics | 2003-10-14 | Paper |
Interval degree and bandwidth of a graph
Discrete Applied Mathematics | 2003-09-09 | Paper |
scientific article; zbMATH DE number 1953095 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1953083 (Why is no real title available?)
| 2003-07-25 | Paper |
Pathwidth of planar and line graphs
Graphs and Combinatorics | 2003-07-08 | Paper |
scientific article; zbMATH DE number 1947394 (Why is no real title available?)
| 2003-07-08 | Paper |
On the domination search number
Discrete Applied Mathematics | 2003-06-10 | Paper |
scientific article; zbMATH DE number 1877050 (Why is no real title available?)
| 2003-04-03 | Paper |
Approximation algorithms for time-dependent orienteering.
Information Processing Letters | 2003-01-21 | Paper |
Approximating minimum cocolorings.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1839476 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1839437 (Why is no real title available?)
| 2002-12-02 | Paper |
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms | 2002-09-30 | Paper |
scientific article; zbMATH DE number 1696531 (Why is no real title available?)
| 2002-07-14 | Paper |
The search and the node-search number of dual graphs
Vestnik Syktyvkarskogo Universiteta. Seriya 1. Matematika, Mekhanika, Informatika | 2002-04-08 | Paper |
Bilateral orientations and domination
| 2001-10-24 | Paper |
The total vertex separation number and profile of a graph
Discrete Mathematics and Applications | 2001-08-02 | Paper |
Graph searching and interval completion
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1149743 (Why is no real title available?)
| 1999-10-31 | Paper |
Note on a helicopter search problem on graphs
Discrete Applied Mathematics | 1999-09-22 | Paper |
Searching expenditure and interval graphs
Discrete Applied Mathematics | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1262811 (Why is no real title available?)
| 1999-04-28 | Paper |
scientific article; zbMATH DE number 1151792 (Why is no real title available?)
| 1998-10-19 | Paper |
Helicopter search problems, bandwidth and pathwidth
Discrete Applied Mathematics | 1998-07-28 | Paper |
scientific article; zbMATH DE number 1164584 (Why is no real title available?)
| 1998-06-11 | Paper |
The search for the evader on 3-minimal trees
Vestnik St. Petersburg University. Mathematics | 1997-11-20 | Paper |
A search problem on a graph under restriction of the velocity
Vestnik St. Petersburg University. Mathematics | 1997-02-03 | Paper |
