| Publication | Date of Publication | Type |
|---|
On graphs coverable by \(k\) shortest paths
| 2024-09-11 | Paper |
On graphs coverable by \({k}\) shortest paths
SIAM Journal on Discrete Mathematics | 2024-06-25 | Paper |
On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
Theoretical Computer Science | 2024-04-04 | Paper |
scientific article; zbMATH DE number 7803595 (Why is no real title available?)
| 2024-02-12 | Paper |
A meta-theorem for distributed certification
Algorithmica | 2024-01-25 | Paper |
On the power of threshold-based algorithms for detecting cycles in the CONGEST model
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Energy-efficient distributed algorithms for synchronous networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
A cubic vertex-kernel for trivially perfect editing
| 2023-08-08 | Paper |
A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
Algorithmica | 2023-04-11 | Paper |
Three notes on distributed property testing
| 2023-02-03 | Paper |
Local certification of graphs with bounded genus
Discrete Applied Mathematics | 2022-12-08 | Paper |
A meta-theorem for distributed certification
| 2022-11-11 | Paper |
On graphs coverable by k shortest paths
| 2022-06-30 | Paper |
The role of randomness in the broadcast congested clique model
Information and Computation | 2021-11-25 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
On the heapability of finite partial orders
| 2021-01-05 | Paper |
Graph reconstruction in the congested clique
Journal of Computer and System Sciences | 2020-06-09 | Paper |
The impact of locality in the broadcast congested clique model
SIAM Journal on Discrete Mathematics | 2020-03-20 | Paper |
On distributed Merlin-Arthur decision protocols
| 2020-03-03 | Paper |
The impact of locality on the detection of cycles in the broadcast congested clique model
| 2020-02-12 | Paper |
Large induced subgraphs via triangulations and CMSO
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
Algorithmica | 2019-03-11 | Paper |
An \(O(n^2)\) time algorithm for the minimal permutation completion problem
Discrete Applied Mathematics | 2019-02-08 | Paper |
Two rounds are enough for reconstructing any graph (class) in the congested clique model
| 2019-01-30 | Paper |
Distributed testing of excluded subgraphs
| 2018-08-16 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Algorithmica | 2018-05-23 | Paper |
Brief announcement: Deterministic graph connectivity in the broadcast congested clique
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Large Induced Subgraphs via Triangulations and CMSO
SIAM Journal on Computing | 2017-01-13 | Paper |
On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Treewidth and pathwidth parameterized by the vertex cover number
Discrete Applied Mathematics | 2016-11-24 | Paper |
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On treewidth approximations
| 2016-07-01 | Paper |
Injective colorings with arithmetic constraints
Graphs and Combinatorics | 2015-12-17 | Paper |
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Distributed Computing | 2015-07-22 | Paper |
Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Lecture Notes in Computer Science | 2014-09-02 | Paper |
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
Structural Information and Communication Complexity | 2014-08-07 | Paper |
(Circular) backbone colouring: forest backbones in planar graphs
Discrete Applied Mathematics | 2014-05-06 | Paper |
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
Discrete Applied Mathematics | 2014-04-02 | Paper |
The complexity of the bootstraping percolation and other problems
Theoretical Computer Science | 2014-01-16 | Paper |
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
Theoretical Computer Science | 2014-01-10 | Paper |
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics | 2012-05-30 | Paper |
Exact algorithm for the maximum induced planar subgraph problem
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On dissemination thresholds in regular and irregular graph classes
Algorithmica | 2011-03-02 | Paper |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics | 2010-04-28 | Paper |
Minimal proper interval completions
Information Processing Letters | 2010-04-19 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Coloring powers of graphs of bounded clique-width.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Constructing Brambles
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Pathwidth is NP-Hard for Weighted Trees
Frontiers in Algorithmics | 2009-07-14 | Paper |
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing | 2009-06-22 | Paper |
Minimal interval completion through graph exploration
Theoretical Computer Science | 2009-02-19 | Paper |
Feedback vertex set on AT-free graphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
Minimal Proper Interval Completions
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Pathwidth of Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Minimal Interval Completion Through Graph Exploration
Algorithms and Computation | 2008-04-24 | Paper |
On Dissemination Thresholds in Regular and Irregular Graph Classes
Lecture Notes in Computer Science | 2008-04-15 | Paper |
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics | 2007-09-19 | Paper |
Characterizing Minimal Interval Completions
STACS 2007 | 2007-09-03 | Paper |
Connected Graph Searching in Outerplanar Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Treewidth of planar graphs: connections with duality
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
On treewidth approximations.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Chordal embeddings of planar graphs
Discrete Mathematics | 2004-01-05 | Paper |
Approximating the treewidth of AT-free graphs.
Discrete Applied Mathematics | 2003-09-25 | Paper |
scientific article; zbMATH DE number 1696522 (Why is no real title available?)
| 2002-07-22 | Paper |
Listing all potential maximal cliques of a graph
Theoretical Computer Science | 2002-07-15 | Paper |
Treewidth and minimum fill-in: Grouping the minimal separators
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1500539 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 1304320 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1305094 (Why is no real title available?)
| 1999-06-17 | Paper |
