| Publication | Date of Publication | Type |
|---|
| On the spanning trees of weighted graphs | 2024-02-28 | Paper |
| On polynomial ideals, their complexity, and applications | 2022-12-09 | Paper |
| The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups | 2022-12-09 | Paper |
| Vladimir Gerdt dies at 73 | 2022-09-06 | Paper |
| Memories on Vladimir Gerdt | 2021-09-29 | Paper |
| Inequalities for the Number of Walks in Graphs | 2019-09-17 | Paper |
| Complexity of Membership Problems of Different Types of Polynomial Ideals | 2018-11-16 | Paper |
| Embedding graphs with bounded treewidth into optimal hypercubes | 2017-11-16 | Paper |
| Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities | 2017-03-16 | Paper |
| Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms | 2016-05-11 | Paper |
| Degree bounds for Gröbner bases of low-dimensional polynomial ideals | 2015-09-17 | Paper |
| Space-efficient Gröbner basis computation without degree bounds | 2015-06-09 | Paper |
| A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application | 2014-07-08 | Paper |
| Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities | 2014-07-07 | Paper |
| Inequalities for the number of walks in graphs | 2013-11-11 | Paper |
| Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets | 2013-06-28 | Paper |
| Dimension-dependent bounds for Gröbner bases of polynomial ideals | 2013-01-10 | Paper |
| On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions | 2008-07-04 | Paper |
| Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations | 2008-07-01 | Paper |
| Automated Deduction in Geometry | 2006-10-20 | Paper |
| Computer Algebra in Scientific Computing | 2006-07-07 | Paper |
| SCHEDULING INTERVAL ORDERS IN PARALLEL | 2004-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818838 | 2004-09-24 | Paper |
| Efficient Embeddings into Hypercube-like Topologies | 2004-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813062 | 2004-08-12 | Paper |
| Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536417 | 2002-11-25 | Paper |
| Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes | 2002-09-30 | Paper |
| Efficient Dynamic Embeddings of Binary Trees into Hypercubes | 2002-09-30 | Paper |
| Optimal dynamic embeddings of complete binary trees into hypercubes | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536921 | 2002-06-25 | Paper |
| An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups | 2002-04-26 | Paper |
| On-line scheduling of parallel jobs with runtime restrictions | 2002-03-03 | Paper |
| An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227325 | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227324 | 1999-10-14 | Paper |
| Some complexity results for polynomial ideals | 1999-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4380159 | 1998-06-04 | Paper |
| Divide-and-conquer algorithms on the hypercube | 1997-09-10 | Paper |
| Counting Minimum Weight Spanning Trees | 1997-08-25 | Paper |
| A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube | 1996-05-06 | Paper |
| Optimal routing of parentheses on the hypercube | 1995-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281517 | 1994-11-13 | Paper |
| Pipelined parallel prefix computations, and sorting on a pipelined hypercube | 1993-06-29 | Paper |
| On the spanning trees of weighted graphs | 1993-03-10 | Paper |
| The complexity of circuit value and network stability | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3468890 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477945 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477976 | 1990-01-01 | Paper |
| Parallel approximation algorithms for bin packing | 1989-01-01 | Paper |
| Projections of vector addition system reachability sets are semilinear | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798222 | 1988-01-01 | Paper |
| Parallelism and the maximal path problem | 1987-01-01 | Paper |
| Two Processor Scheduling is in $\mathcal{NC}$ | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785968 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731028 | 1986-01-01 | Paper |
| An Algorithm for the General Petri Net Reachability Problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680870 | 1984-01-01 | Paper |
| The complexity of the word problems for commutative semigroups and polynomial ideals | 1982-01-01 | Paper |
| Persistence of vector replacement systems is decidable | 1981-01-01 | Paper |
| The Complexity of the Finite Containment Problem for Petri Nets | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3932309 | 1980-01-01 | Paper |
