| Publication | Date of Publication | Type |
|---|
| Constructing and sampling partite, $3$-uniform hypergraphs with given degree sequence | 2023-08-25 | Paper |
| Primal-dual approach for directed vertex connectivity augmentation and generalizations | 2018-11-05 | Paper |
| Augmenting undirected connectivity in RNC and in randomized Õ(n3) time | 2016-09-01 | Paper |
| Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs | 2015-06-02 | Paper |
| Functional dependencies on extended relations defined by regular languages | 2015-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2937612 | 2015-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921669 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395596 | 2014-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396881 | 2009-09-22 | Paper |
| Deformable Polygon Representation and Near-Mincuts | 2009-02-12 | Paper |
| Advances in Databases and Information Systems | 2005-08-19 | Paper |
| The evolution of human communication and the information revolution --- A mathematical perspective | 2004-08-06 | Paper |
| Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413679 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770735 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770736 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753925 | 2001-12-18 | Paper |
| Augmenting Undirected Edge Connectivity in Õ(n2) Time | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231914 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938791 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250218 | 2000-02-09 | Paper |
| Parallel and fast sequential algorithms for undirected edge connectivity augmentation | 2000-02-07 | Paper |
| Covering symmetric supermodular functions by graphs | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258674 | 1999-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228453 | 1999-05-18 | Paper |
| Some constraints assuring serializability in multidatabases | 1998-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362244 | 1997-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362235 | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4357748 | 1997-09-28 | Paper |
| Classical and weighted knowledgebase transformations | 1996-11-27 | Paper |
| Counterexamples for Directed and Node Capacitated Cut-Trees | 1996-03-18 | Paper |
| On a general class of data dependencies in the relational model and its implication problems | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5748646 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802594 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835056 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729415 | 1987-01-01 | Paper |
| On the number of occurrences of sequence patterns | 1986-01-01 | Paper |
| On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779790 | 1986-01-01 | Paper |
| A general treatment of rearrangement problems in a linear storage | 1982-01-01 | Paper |
| Dynamic placement of records and the classical occupancy problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908462 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192953 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3868556 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192952 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139668 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164791 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105137 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5649872 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4765810 | 1968-01-01 | Paper |
