| Publication | Date of Publication | Type |
|---|
Chordal graphs and their clique graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
Edge-treewidth: algorithmic and combinatorial properties
Discrete Applied Mathematics | 2023-11-13 | Paper |
Connected search for a lazy robber
Journal of Graph Theory | 2023-10-04 | Paper |
Universal Obstructions of Graph Parameters
| 2023-04-27 | Paper |
Graph Parameters, Universal Obstructions, and WQO
| 2023-04-07 | Paper |
The mixed search game against an agile and visible fugitive is monotone
Discrete Mathematics | 2023-02-21 | Paper |
scientific article; zbMATH DE number 7651203 (Why is no real title available?)
| 2023-02-07 | Paper |
Connected Search for a Lazy Robber
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7559418 (Why is no real title available?)
| 2022-07-18 | Paper |
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
| 2022-05-20 | Paper |
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
Discrete Applied Mathematics | 2022-03-24 | Paper |
A linear fixed parameter tractable algorithm for connected pathwidth
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Edge degeneracy: algorithmic and structural results
Theoretical Computer Science | 2020-09-03 | Paper |
Hierarchical Clusterings of Unweighted Graphs
| 2020-08-07 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
| 2020-05-27 | Paper |
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs
| 2020-05-27 | Paper |
On independent set in \(B_1\)-EPG graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Explicit linear kernels for packing problems
Algorithmica | 2019-04-25 | Paper |
Strong immersion is a well-quasi-ordering for semicomplete digraphs
Journal of Graph Theory | 2019-04-25 | Paper |
Exploring the complexity of layout parameters in tournaments and semicomplete digraphs
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
An FPT 2-approximation for tree-cut decomposition
Algorithmica | 2018-02-28 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Bulletin of Mathematical Biology | 2017-10-20 | Paper |
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
Algorithmica | 2017-10-10 | Paper |
Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism
| 2017-09-29 | Paper |
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
| 2017-09-29 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
Theoretical Computer Science | 2017-08-24 | Paper |
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Explicit linear kernels via dynamic programming
| 2017-03-03 | Paper |
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Approximate distance labeling schemes
| 2016-07-01 | Paper |
On independent set on B1-EPG graphs
Approximation and Online Algorithms | 2016-02-26 | Paper |
An FPT 2-approximation for tree-cut decomposition
Lecture Notes in Computer Science | 2016-02-26 | Paper |
Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Explicit linear kernels via dynamic programming
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Hadwiger number of graphs with small chordality
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Hadwiger number of graphs with small chordality
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Partition refinement techniques: an interesting algorithmic tool kit
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Hitting and harvesting pumpkins
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Practical and efficient circle graph recognition
Algorithmica | 2014-11-19 | Paper |
Practical and efficient split decomposition via graph-labelled trees
Algorithmica | 2014-11-19 | Paper |
A survey of the algorithmic aspects of modular decomposition
Computer Science Review | 2014-10-07 | Paper |
A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics | 2014-05-05 | Paper |
Obtaining a bipartite graph by contracting few edges
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Parameterized domination in circle graphs
Theory of Computing Systems | 2014-03-25 | Paper |
Contracting graphs to paths and trees
Algorithmica | 2014-03-25 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Eclecticism shrinks even small worlds
Distributed Computing | 2013-06-13 | Paper |
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
Algorithmica | 2013-05-16 | Paper |
Parameterized Domination in Circle Graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Kernels for feedback arc set in tournaments
| 2012-10-24 | Paper |
Obtaining a bipartite graph by contracting few edges
| 2012-08-31 | Paper |
A single-exponential FPT algorithm for the \(K _{4}\)-minor cover problem
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Contracting graphs to paths and trees
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Hitting and harvesting pumpkins
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
Parameterized and Exact Computation | 2010-12-07 | Paper |
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Milling a graph with turn costs: a parameterized complexity perspective
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Polynomial kernels for 3-leaf power graph modification problems
Discrete Applied Mathematics | 2010-11-05 | Paper |
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Algorithmica | 2010-09-16 | Paper |
Branchwidth of chordal graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
A more efficient algorithm for perfect sorting by reversals
Information Processing Letters | 2010-04-19 | Paper |
Optimal distance labeling for interval and circular-arc graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A simple linear time LexBFS cograph recognition algorithm.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Polynomial kernels for 3-leaf power graph modification problems
Lecture Notes in Computer Science | 2009-12-11 | Paper |
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Interval Completion Is Fixed Parameter Tractable
SIAM Journal on Computing | 2009-11-06 | Paper |
Optimal Distance Labeling for Interval Graphs and Related Graph Families
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
The Structure of Level-k Phylogenetic Networks
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Kinetic maintenance of mobile \(k\)-centres on trees
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the approximability of the maximum agreement subtree and maximum compatible tree problems
Discrete Applied Mathematics | 2009-06-30 | Paper |
Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
Discrete Mathematics | 2009-06-17 | Paper |
A note on finding all homogeneous set sandwiches
Information Processing Letters | 2009-04-28 | Paper |
scientific article; zbMATH DE number 5485472 (Why is no real title available?)
| 2009-01-05 | Paper |
Generation of Graphs with Bounded Branchwidth
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Automata, Languages and Programming | 2008-08-28 | Paper |
Dynamic Distance Hereditary Graphs Using Split Decomposition
Algorithms and Computation | 2008-05-27 | Paper |
Kinetic Maintenance of Mobile k-Centres on Trees
Algorithms and Computation | 2008-05-27 | Paper |
Competitive graph searches
Theoretical Computer Science | 2008-04-15 | Paper |
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Edge-maximal graphs of branchwidth k
Electronic Notes in Discrete Mathematics | 2007-05-29 | 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 |
Fully dynamic recognition algorithm and certificate for directed cographs
Discrete Applied Mathematics | 2006-08-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics | 2005-02-22 | Paper |
Distance labeling scheme and split decomposition
Discrete Mathematics | 2004-01-05 | Paper |
scientific article; zbMATH DE number 1875437 (Why is no real title available?)
| 2003-03-02 | Paper |
Diameter determination on restricted graph families
Discrete Applied Mathematics | 2002-08-14 | Paper |
Linear time recognition of \(P_4\)-indifference graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1262798 (Why is no real title available?)
| 1999-04-26 | Paper |
