| Publication | Date of Publication | Type |
|---|
Hybrid k-clustering: blending k-median and k-center
ACM Transactions on Computation Theory | 2026-01-20 | Paper |
| Computing tree decompositions with small independence number | 2026-01-14 | Paper |
| Two-sets cut-uncut on planar graphs | 2026-01-14 | Paper |
| Stability in graphs with matroid constraints | 2025-12-02 | Paper |
Computing paths of large rank in planar frameworks deterministically
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
| Kernelization for spreading points | 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 |
| Parameterized and approximation algorithms for the maximum bimodal subgraph problem | 2024-10-14 | 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 |
| Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves | 2024-05-29 | Paper |
| Shortest cycles with monotone submodular costs | 2024-05-14 | Paper |
| Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes | 2024-05-14 | Paper |
| Fixed-parameter tractability of maximum colored path and beyond | 2024-05-14 | 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 |
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?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7788495 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788594 (Why is no real title available?) | 2024-01-15 | Paper |
Diverse Pairs of Matchings
(available as arXiv preprint) | 2023-11-14 | Paper |
Recognizing Proper Tree-Graphs
(available as arXiv preprint) | 2023-11-13 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | 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.
(available as arXiv preprint) | 2023-10-31 | Paper |
Combing a Linkage in an Annulus
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
ACM Transactions on Algorithms | 2023-10-23 | Paper |
On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
Lecture Notes in Computer Science | 2023-10-04 | 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.
(available as arXiv preprint) | 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 |
| 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
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650249 (Why is no real title available?) | 2023-02-03 | Paper |
| Parameterized k-Clustering: Tractability Island | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
Clustering to Given Connectivities
(available as arXiv preprint) | 2023-02-03 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
Lossy kernelization of same-size clustering
(available as arXiv preprint) | 2022-11-11 | Paper |
Graph square roots of small distance from degree one graphs
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | 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 |
Partitioning \(H\)-free graphs of bounded diameter
Theoretical Computer Science | 2022-08-25 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
Graph square roots of small distance from degree one graphs
Theory of Computing Systems | 2022-07-26 | Paper |
scientific article; zbMATH DE number 7561552 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
| Modification to Planarity is Fixed Parameter Tractable | 2022-07-18 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
(available as arXiv preprint) | 2022-06-08 | Paper |
| scientific article; zbMATH DE number 7525484 (Why is no real title available?) | 2022-05-11 | Paper |
Parameterized complexity of elimination distance to first-order logic properties
ACM Transactions on Computational Logic | 2022-04-29 | Paper |
Cyclability in graph classes
Discrete Applied Mathematics | 2022-03-28 | Paper |
Parameterized complexity of categorical clustering with size constraints
(available as arXiv preprint) | 2022-03-25 | Paper |
| Longest Cycle above Erd\H{o}s-Gallai Bound | 2022-02-07 | Paper |
Induced disjoint paths in AT-free graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
| Compound Logics for Modification Problems | 2021-11-04 | Paper |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Journal of Computer and System Sciences | 2021-10-28 | Paper |
scientific article; zbMATH DE number 7378700 (Why is no real title available?)
(available as arXiv preprint) | 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 |
Partitioning H-Free Graphs of Bounded Diameter
(available as arXiv preprint) | 2021-05-10 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
Acyclic, Star, and Injective Colouring: Bounding the Diameter
(available as arXiv preprint) | 2021-04-21 | Paper |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Parameterized \(k\)-clustering: tractability island
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Parameterized low-rank binary matrix approximation
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
Parameterized low-rank binary matrix approximation
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
Going far from degeneracy
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
Graph Square Roots of Small Distance from Degree One Graphs
(available as arXiv preprint) | 2020-10-12 | Paper |
On the tractability of optimization problems on \(H\)-graphs
Algorithmica | 2020-09-03 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-08-25 | Paper |
| Partial complementation of graphs | 2020-08-25 | Paper |
Finding connected secluded subgraphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding connected secluded subgraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
| Covering vectors by spaces: regular matroids | 2020-05-27 | Paper |
| Structured connectivity augmentation | 2020-05-26 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Subgraph complementation
Algorithmica | 2020-05-21 | Paper |
Enumeration of minimal connected dominating sets for chordal graphs
Discrete Applied Mathematics | 2020-04-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 |
Spanning circuits in regular matroids
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Surjective \(H\)-colouring: new hardness results
Computability | 2019-10-28 | Paper |
Editing to Connected F-Degree Graph
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Enumeration and maximum number of minimal dominating sets for chordal graphs
Theoretical Computer Science | 2019-08-13 | Paper |
Enumeration and maximum number of maximal irredundant sets for chordal graphs
Discrete Applied Mathematics | 2019-07-17 | Paper |
| Planar Disjoint Paths in Linear Time | 2019-07-12 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | 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 |
Enumeration of maximal irredundant sets for claw-free graphs
Theoretical Computer Science | 2018-12-04 | 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 |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Finding cactus roots in polynomial time
Theory of Computing Systems | 2018-08-03 | Paper |
Spanning circuits in regular matroids
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Algorithmica | 2018-04-06 | Paper |
| Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth | 2018-03-15 | Paper |
| Editing to connected \(f\)-degree graph | 2018-01-24 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Enumeration and maximum number of maximal irredundant sets for chordal graphs
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Enumeration and maximum number of minimal connected vertex covers in graphs
European Journal of Combinatorics | 2017-11-14 | Paper |
Parameterized complexity of superstring problems
Algorithmica | 2017-11-09 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-10-17 | Paper |
Parameterized complexity of secluded connectivity problems
Theory of Computing Systems | 2017-10-12 | Paper |
Parameterized complexity of secluded connectivity problems
Theory of Computing Systems | 2017-10-12 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2017-09-29 | Paper |
Variants of plane diameter completion
(available as arXiv preprint) | 2017-09-29 | Paper |
Editing to a connected graph of given degrees
Information and Computation | 2017-09-28 | Paper |
On the tractability of optimization problems on H-graphs
(available as arXiv preprint) | 2017-09-27 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
Surjective \(H\)-colouring: new hardness results
(available as arXiv preprint) | 2017-08-04 | Paper |
| Surjective \(H\)-colouring: new hardness results | 2017-08-04 | Paper |
Enumeration of maximal irredundant sets for claw-free graphs
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| Parameterized complexity of secluded connectivity problems | 2017-07-13 | Paper |
Metric Dimension of Bounded Tree-length Graphs
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
| Editing to Eulerian graphs | 2017-04-25 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Journal of Graph Theory | 2017-04-21 | Paper |
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Journal of Graph Theory | 2017-04-21 | Paper |
The parameterized complexity of graph cyclability
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
| Parameterized complexity of the anchored \(k\)-core problem for directed graphs | 2017-02-21 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
Graph editing to a given degree sequence
Theoretical Computer Science | 2017-02-06 | Paper |
Graph editing to a given degree sequence
Theoretical Computer Science | 2017-02-06 | Paper |
Editing to a planar graph of given degrees
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics | 2016-11-24 | Paper |
On recognition of threshold tolerance graphs and their complements
Discrete Applied Mathematics | 2016-11-24 | Paper |
Graph editing to a fixed target
Discrete Applied Mathematics | 2016-11-24 | Paper |
Finding cactus roots in polynomial time
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Graph editing to a given degree sequence
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Theoretical Computer Science | 2016-07-05 | Paper |
Enumerating minimal connected dominating sets in graphs of bounded chordality
Theoretical Computer Science | 2016-05-02 | Paper |
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
Information and Computation | 2016-03-10 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Editing to Eulerian graphs
Journal of Computer and System Sciences | 2015-12-11 | Paper |
How to hunt an invisible rabbit on a graph
European Journal of Combinatorics | 2015-12-11 | Paper |
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Metric dimension of bounded width graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Editing to a graph of given degrees
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Recognizing threshold tolerance graphs in \(O(n^2)\) time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Hadwiger number of graphs with small chordality
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Minimizing Rosenthal potential in multicast games
Theory of Computing Systems | 2015-09-04 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Algorithmica | 2015-09-02 | Paper |
Parameterized complexity of superstring problems
Lecture Notes in Computer Science | 2015-08-20 | Paper |
Hadwiger number of graphs with small chordality
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Editing to a graph of given degrees
Theoretical Computer Science | 2015-07-13 | Paper |
Modifying a graph using vertex elimination
Algorithmica | 2015-05-21 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
List coloring in the absence of a linear forest
Algorithmica | 2015-03-02 | Paper |
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
SIAM Journal on Computing | 2015-02-09 | Paper |
Coloring graphs characterized by a forbidden subgraph
Discrete Applied Mathematics | 2014-11-28 | Paper |
Parameterized complexity of three edge contraction problems with degree constraints
Acta Informatica | 2014-11-14 | Paper |
Editing to a connected graph of given degrees
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The parameterized complexity of graph cyclability
Lecture Notes in Computer Science | 2014-10-08 | Paper |
Long circuits and large Euler subgraphs
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Finding clubs in graph classes
Discrete Applied Mathematics | 2014-08-22 | Paper |
Lift-contractions
European Journal of Combinatorics | 2014-07-29 | Paper |
Closing complexity gaps for coloring problems on \(H\)-free graphs
Information and Computation | 2014-07-18 | Paper |
Detecting fixed patterns in chordal graphs in polynomial time
Algorithmica | 2014-07-03 | Paper |
Parameterized algorithms to preserve connectivity
Automata, Languages, and Programming | 2014-07-01 | Paper |
Solutions for the stable roommates problem with payments
Theoretical Computer Science | 2014-06-06 | Paper |
| Algorithmic lower bounds for problems parameterized by clique-width | 2014-05-22 | Paper |
Subset feedback vertex sets in chordal graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics | 2014-03-27 | Paper |
List coloring in the absence of two subgraphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science | 2014-01-24 | Paper |
Graph editing to a fixed target
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Detecting induced minors in AT-free graphs
Theoretical Computer Science | 2014-01-09 | Paper |
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Theoretical Computer Science | 2014-01-07 | Paper |
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
Parameterized and Exact Computation | 2013-12-10 | Paper |
Sparse square roots
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Increasing the minimum degree of a graph by contractions
Theoretical Computer Science | 2013-11-29 | Paper |
| Lift contractions | 2013-11-01 | Paper |
On the Parameterized Complexity of Cutting a Few Vertices from a Graph
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Long circuits and large Euler subgraphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Automata, Languages, and Programming | 2013-08-06 | Paper |
Colorings with few colors: counting, enumeration and combinatorial bounds
Theory of Computing Systems | 2013-08-01 | Paper |
List coloring in the absence of two subgraphs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Cliques and clubs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Obtaining planarity by contracting few edges
Theoretical Computer Science | 2013-04-17 | Paper |
Spanners of bounded degree graphs
Information Processing Letters | 2013-04-04 | Paper |
Closing complexity gaps for coloring problems on \(H\)-free graphs
Algorithms and Computation | 2013-03-21 | Paper |
Detecting induced minors in AT-free graphs
Algorithms and Computation | 2013-03-21 | Paper |
Choosability on \(H\)-free graphs
Information Processing Letters | 2013-03-20 | Paper |
Three complexity results on coloring \(P_k\)-free graphs
European Journal of Combinatorics | 2013-01-24 | Paper |
An exact algorithm for subset feedback vertex set on chordal graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Cops and robber game without recharging
Theory of Computing Systems | 2012-12-06 | Paper |
4-coloring \(H\)-free graphs when \(H\) is small
Discrete Applied Mathematics | 2012-11-22 | Paper |
Parameterized complexity of the spanning tree congestion problem
Algorithmica | 2012-11-21 | Paper |
Solutions for the stable roommates problem with payments
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
How to eliminate a graph
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Minimizing Rosenthal potential in multicast games
Automata, Languages, and Programming | 2012-11-01 | Paper |
Paths of bounded length and their cuts: parameterized complexity and algorithms
Discrete Optimization | 2012-10-16 | Paper |
Finding vertex-surjective graph homomorphisms
Acta Informatica | 2012-10-15 | Paper |
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science | 2012-10-11 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Induced disjoint paths in claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Coloring graphs characterized by a forbidden subgraph
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Cops and robber with constraints
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
| Parameterized complexity of connected even/odd subgraph problems | 2012-08-23 | Paper |
Induced disjoint paths in AT-free graphs
Lecture Notes in Computer Science | 2012-08-14 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
Parameterized and Exact Computation | 2012-06-15 | Paper |
Increasing the minimum degree of a graph by contractions
Parameterized and Exact Computation | 2012-06-15 | Paper |
4-coloring \(H\)-free graphs when \(H\) is small
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
Theoretical Computer Science | 2012-05-14 | Paper |
Distance three labelings of trees
Discrete Applied Mathematics | 2012-05-11 | Paper |
Edge search number of cographs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics | 2012-05-11 | Paper |
| Approximating acyclicity parameters of sparse hypergraphs | 2012-04-24 | Paper |
Containment relations in split graphs
Discrete Applied Mathematics | 2012-03-19 | 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 |
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science | 2012-03-13 | Paper |
Induced packing of odd cycles in planar graphs
Theoretical Computer Science | 2012-03-13 | Paper |
Spanners in sparse graphs
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Finding contractions and induced minors in chordal graphs via disjoint paths
Algorithms and Computation | 2011-12-16 | Paper |
List coloring in the absence of a linear forest
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
How to guard a graph?
Algorithmica | 2011-12-14 | Paper |
Guard games on graphs: keep the intruder out!
Theoretical Computer Science | 2011-12-07 | Paper |
Bandwidth on AT-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Branch and recharge: exact algorithms for generalized domination
Algorithmica | 2011-09-20 | Paper |
Coloring graphs without short cycles and long induced paths
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Contracting a chordal graph to a split graph or a tree
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Contraction obstructions for treewidth
Journal of Combinatorial Theory. Series B | 2011-08-10 | Paper |
Computing vertex-surjective homomorphisms to partially reflexive trees
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Parameterized complexity of coloring problems: treewidth versus vertex cover
Theoretical Computer Science | 2011-05-18 | Paper |
| \(L(2,1)\)-coloring of precolored cacti | 2011-03-18 | 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 |
On coloring graphs without induced forests
Algorithms and Computation | 2010-12-09 | Paper |
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Colorings with few colors: counting, enumeration and combinatorial bounds
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Intractability of clique-width parameterizations
SIAM Journal on Computing | 2010-11-04 | Paper |
Sort and Search: exact algorithms for generalized domination
Information Processing Letters | 2010-08-20 | Paper |
Cops and Robber game without recharging
Lecture Notes in Computer Science | 2010-06-22 | Paper |
\(L(2,1,1)\)-labeling is NP-complete for trees
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics | 2010-05-25 | Paper |
Guard games on graphs: keep the intruder out!
Approximation and Online Algorithms | 2010-05-11 | Paper |
Pursuing a fast robber on a graph
Theoretical Computer Science | 2010-03-09 | Paper |
Parameterized Complexity of Generalized Domination Problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Paths of bounded length and their cuts: parameterized complexity and algorithms
Parameterized and Exact Computation | 2010-01-14 | Paper |
Backbone colorings for networks.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Induced Packing of Odd Cycles in a Planar Graph
Algorithms and Computation | 2009-12-17 | Paper |
Bandwidth on AT-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
The capture time of a graph
Discrete Mathematics | 2009-12-15 | 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 |
Choosability of P 5-Free Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Branch and Recharge: Exact Algorithms for Generalized Domination
Lecture Notes in Computer Science | 2009-02-17 | 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 |
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Complexity of the Packing Coloring Problem for Trees
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Spanners in Sparse Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Distance Constrained Labelings of Trees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
| Search in graphs | 2007-08-21 | Paper |
Backbone colorings for graphs: Tree and path backbones
Journal of Graph Theory | 2007-06-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Systems of pairs of \(q\)-distant representatives, and graph colorings
Journal of Mathematical Sciences (New York) | 2006-01-03 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
On a complementary interval graph with the lowest max-degree
Vestnik St. Petersburg University. Mathematics | 2004-02-09 | Paper |
Interval degree and bandwidth of a graph
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1868509 (Why is no real title available?) | 2003-02-13 | Paper |
| scientific article; zbMATH DE number 1868528 (Why is no real title available?) | 2003-02-13 | Paper |
The search and the node-search number of dual graphs
Vestnik Syktyvkarskogo Universiteta. Seriya 1. Matematika, Mekhanika, Informatika | 2002-04-08 | Paper |
Invariants of graphs defined through optimal numbering of vertices and the operation of joining graphs
Vestnik Syktyvkarskogo Universiteta. Seriya 1. Matematika, Mekhanika, Informatika | 2001-08-28 | 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 |
The total vertex separation number of a graph
Discrete Mathematics and Applications | 2001-01-04 | Paper |
| scientific article; zbMATH DE number 1149743 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1262811 (Why is no real title available?) | 1999-04-28 | Paper |
| scientific article; zbMATH DE number 1164584 (Why is no real title available?) | 1998-06-11 | Paper |
The \(k\)-search number of graphs of regular polyhedra
Vestnik St. Petersburg University. Mathematics | 1998-01-14 | Paper |
Some generalizations of the problem on the search number of a graph
Vestnik St. Petersburg University. Mathematics | 1997-11-20 | Paper |
Minimal trees of a given search number
Cybernetics and Systems Analysis | 1997-01-14 | Paper |
Computing the isoperimetric number of a graph
Cybernetics and Systems Analysis | 1996-02-08 | Paper |
The cutwidth and the vertex separation number of hypergraphs and their König’s representations
Discrete Mathematics and Applications | 1996-01-15 | Paper |
The cutwidth of a graph and the vertex separation number of the line graph
Discrete Mathematics and Applications | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 146433 (Why is no real title available?) | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 4202053 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4156240 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4174651 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4154499 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4183469 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4162691 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4123550 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4091210 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4105017 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3993644 (Why is no real title available?) | 1986-01-01 | Paper |
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
(available as arXiv preprint) | N/A | Paper |
