| Publication | Date of Publication | Type |
|---|
| Solving edge clique cover exactly via synergistic data reduction | 2025-01-06 | Paper |
| Effective data reduction for the vertex clique cover problem | 2024-05-24 | Paper |
| A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem | 2023-07-25 | Paper |
scientific article; zbMATH DE number 7651198 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Simultaneous representation of proper and unit interval graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Engineering Kernelization for Maximum Cut
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Engineering Data Reduction for Nested Dissection
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| On Romeo and Juliet problems: minimizing distance-to-sight | 2020-08-25 | Paper |
Convexity-increasing morphs of planar graphs
Computational Geometry | 2019-10-25 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
Exactly solving the maximum weight independent set problem on large real-world graphs
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Scalable edge partitioning
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Practical minimum cut algorithms
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Scalable kernelization for maximum independent sets
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Finding near-optimal independent sets at scale
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Simultaneous Representation of Proper and Unit Interval Graphs
(available as arXiv preprint) | 2019-08-23 | Paper |
| Linear-time algorithms for geometric graphs with sublinearly many crossings | 2019-05-06 | Paper |
Practical minimum cut algorithms
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Reconstructing generalized staircase polygons with uniform step length
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Convexity-increasing morphs of planar graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
On the complexity of barrier resilience for fat regions and bounded ply
Computational Geometry | 2018-10-31 | Paper |
On the complexity of barrier resilience for fat regions and bounded ply
Computational Geometry | 2018-10-31 | Paper |
Reconstructing generalized staircase polygons with uniform step length
Journal of Graph Algorithms and Applications | 2018-10-25 | Paper |
| On the complexity of barrier resilience for fat regions | 2018-10-17 | Paper |
Efficiently enumerating all maximal cliques with bit-parallelism
Computers & Operations Research | 2018-07-12 | Paper |
Finding near-optimal independent sets at scale
Journal of Heuristics | 2017-09-08 | Paper |
Listing all maximal cliques in large sparse real-world graphs
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
On minimizing crossings in storyline visualizations
Lecture Notes in Computer Science | 2017-02-10 | Paper |
On the power of simple reductions for the maximum independent set problem
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
Dynamic planar point location with sub-logarithmic local updates
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Theoretical Computer Science | 2012-08-13 | Paper |
Linear-time algorithms for geometric graphs with sublinearly many edge crossings
SIAM Journal on Computing | 2011-04-04 | Paper |
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Listing all maximal cliques in sparse graphs in near-optimal time
Algorithms and Computation | 2010-12-09 | Paper |
Priority Range Trees
Algorithms and Computation | 2010-12-09 | Paper |
Succinct greedy geometric routing in the Euclidean plane
Algorithms and Computation | 2009-12-17 | Paper |
