| Publication | Date of Publication | Type |
|---|
Understanding Computation
Texts in Computer Science | 2024-01-05 | Paper |
Opal: a system for computing noncommutative Gröbner bases
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Labeled cuts in graphs
Theoretical Computer Science | 2016-09-12 | Paper |
Constructing endomorphism rings via duals
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Mining posets from linear orders.
Discrete Mathematics, Algorithms and Applications | 2014-01-28 | Paper |
New algorithms for generating Conway polynomials over finite fields
Journal of Symbolic Computation | 2007-08-24 | Paper |
The PMU Placement Problem
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Processor-efficient sparse matrix-vector multiplication
Computers & Mathematics with Applications | 2005-03-08 | Paper |
Constructing homomorphism spaces and endomorphism rings.
Journal of Symbolic Computation | 2004-08-06 | Paper |
| Graph separators, with applications | 2001-10-15 | Paper |
The pagenumber of \(k\)-trees is \(O(k)\)
Discrete Applied Mathematics | 2001-09-25 | Paper |
Sorting by short block-moves
Algorithmica | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1305433 (Why is no real title available?) | 2000-04-13 | Paper |
Sorting by bounded block-moves
Discrete Applied Mathematics | 1999-11-29 | Paper |
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing | 1999-10-28 | Paper |
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing | 1999-10-28 | Paper |
Edge-packing in planar graphs
Theory of Computing Systems | 1999-01-03 | Paper |
Edge-packing planar graphs by cyclic graphs
Discrete Applied Mathematics | 1998-03-25 | Paper |
An experimental evaluation of local search heuristics for graph partitioning
Computing | 1998-03-18 | Paper |
Stack and Queue Layouts of Posets
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Graph embeddings and simplicial maps
Theory of Computing Systems | 1997-03-11 | Paper |
New results for the minimum weight triangulation problem
Algorithmica | 1995-01-19 | Paper |
The pagenumber of genus <i>g</i> graphs is O( <i>g</i> )
Journal of the ACM | 1994-11-13 | Paper |
Heuristics for laying out information graphs
Computing | 1994-09-01 | Paper |
Representing polyhedra: Faces are better than vertices
Computational Geometry | 1994-02-17 | Paper |
| scientific article; zbMATH DE number 431507 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 432820 (Why is no real title available?) | 1993-10-20 | Paper |
Comparing Queues and Stacks As Machines for Laying Out Graphs
SIAM Journal on Discrete Mathematics | 1993-01-16 | Paper |
Laying Out Graphs Using Queues
SIAM Journal on Computing | 1992-12-06 | Paper |
Covering a set with arithmetic progressions is NP-complete
Information Processing Letters | 1990-01-01 | Paper |
Optimal embeddings of butterfly-like graphs in the hypercube
Mathematical Systems Theory | 1990-01-01 | Paper |
Embedding Outerplanar Graphs in Small Books
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
