| Publication | Date of Publication | Type |
|---|
Greedily finding a dense subgraph
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Experimental Analysis of Treewidth
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
An improved fixed-parameter algorithm for one-page crossing minimization
| 2020-05-27 | Paper |
Positive-instance driven dynamic programming for treewidth
| 2020-05-27 | Paper |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Positive-instance driven dynamic programming for treewidth
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Treedepth Parameterized by Vertex Cover Number.
| 2018-04-10 | Paper |
Fast deflection routing for packets and worms
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
On the fault tolerance of the butterfly
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Computing directed pathwidth in \(O(1.89^n)\) time
Algorithmica | 2016-06-28 | Paper |
A faster fixed parameter algorithm for two-layer crossing minimization
Information Processing Letters | 2016-05-18 | Paper |
On the pathwidth of almost semicomplete digraphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
Algorithmica | 2015-09-02 | Paper |
A linear edge kernel for two-layer crossing minimization
Theoretical Computer Science | 2014-10-06 | Paper |
A linear edge kernel for two-layer crossing minimization
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Route-enabling graph orientation problems
Algorithmica | 2013-03-05 | Paper |
Improved bounds on the planar branchwidth with respect to the largest grid minor size
Algorithmica | 2013-01-28 | Paper |
Computing Directed Pathwidth in O(1.89 n ) Time
Parameterized and Exact Computation | 2013-01-07 | Paper |
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
Algorithms – ESA 2012 | 2012-09-25 | Paper |
A Polynomial Time Algorithm for Bounded Directed Pathwidth
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
Theoretical Computer Science | 2011-07-27 | Paper |
The structure and number of global roundings of a graph
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Improved bounds on the planar branchwidth with respect to the largest grid minor size
Algorithms and Computation | 2010-12-09 | Paper |
\(k\)-cyclic orientations of graphs
Algorithms and Computation | 2010-12-09 | Paper |
A linear time heuristic for the branch-decomposition of planar graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Route-enabling graph orientation problems
Algorithms and Computation | 2009-12-17 | Paper |
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
Algorithms and Computation | 2009-12-17 | Paper |
Voronoi diagrams with respect to criteria on vision information
Japan Journal of Industrial and Applied Mathematics | 2008-09-25 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Matching algorithms are fast in sparse random graphs
Theory of Computing Systems | 2006-10-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
On the probability of rendezvous in graphs
Random Structures & Algorithms | 2005-06-01 | Paper |
Noise-tolerant distribution-free learning of general geometric concepts
Journal of the ACM | 2005-01-25 | Paper |
The structure and number of global roundings of a graph
Theoretical Computer Science | 2004-10-27 | Paper |
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Spanning trees crossing few barriers
Discrete & Computational Geometry | 2004-02-05 | Paper |
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Algorithmica | 2003-08-19 | Paper |
A characterization of planar graphs by pseudo-line arrangements
Algorithmica | 2003-08-17 | Paper |
Enumeration of success patterns in logic programs
Theoretical Computer Science | 2002-05-13 | Paper |
Efficient randomized routing algorithms on the two-dimensional mesh of buses
Theoretical Computer Science | 2001-08-20 | Paper |
Algorithms for the maximum subarray problem based on matrix multiplication
Interdisciplinary Information Sciences (IIS) | 2001-07-12 | Paper |
scientific article; zbMATH DE number 1559543 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1555918 (Why is no real title available?)
| 2001-01-24 | Paper |
Latent semantic indexing: A probabilistic analysis
Journal of Computer and System Sciences | 2000-12-19 | Paper |
Multicolor routing in the undirected hypercube
Discrete Applied Mathematics | 2000-11-22 | Paper |
Greedily Finding a Dense Subgraph
Journal of Algorithms | 2000-08-28 | Paper |
scientific article; zbMATH DE number 1303586 (Why is no real title available?)
| 2000-08-21 | Paper |
scientific article; zbMATH DE number 1263210 (Why is no real title available?)
| 1999-06-29 | Paper |
scientific article; zbMATH DE number 1305444 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1256730 (Why is no real title available?)
| 1999-05-18 | Paper |
Efficient self-embedding of butterfly networks with random faults
Proceedings., 33rd Annual Symposium on Foundations of Computer Science | 1999-05-13 | Paper |
scientific article; zbMATH DE number 1222837 (Why is no real title available?)
| 1998-11-11 | Paper |
scientific article; zbMATH DE number 1104332 (Why is no real title available?)
| 1998-09-07 | Paper |
Efficient Self-Embedding of Butterfly Networks with Random Faults
SIAM Journal on Computing | 1998-05-10 | Paper |
How to cut pseudoparabolas into segments
Discrete & Computational Geometry | 1998-03-11 | Paper |
Routing a permutation in the hypercube by two sets of edge disjoint paths
Journal of Parallel and Distributed Computing | 1997-12-17 | Paper |
Construction of the mesh and the torus tolerating a large number of faults
Journal of Computer and System Sciences | 1997-03-18 | Paper |
Routings for involutions of a hypercube
Discrete Applied Mathematics | 1994-06-09 | Paper |
First order compiler: A deterministic logic program synthesis algorithm
Journal of Symbolic Computation | 1989-01-01 | Paper |
Existential continuation
New Generation Computing | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4106263 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 3982556 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3915612 (Why is no real title available?)
| 1983-01-01 | Paper |
