| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4643829 | 2018-05-29 | Paper |
| Memory-efficient enumeration of constrained spanning trees | 2016-06-16 | Paper |
| Computational experience with a parallel algorithm for tetrangle inequality bound smoothing | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5251964 | 2015-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3110102 | 2012-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015617 | 2011-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999988 | 2011-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581945 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576697 | 2010-07-30 | Paper |
| Parallel heap: an optimal parallel priority queue | 2010-05-31 | Paper |
| Preferential deletion in dynamic models of web-like networks | 2010-01-29 | Paper |
| Graph compression and the zeros of polynomials | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3616679 | 2009-03-26 | Paper |
| A study of the Sudoku graph family | 2009-03-24 | Paper |
| Efficient intrusion-detection using programmable agents based on attack graph patterns | 2009-03-24 | Paper |
| Techniques for analyzing dynamic random graph models of web-like networks: An overview | 2008-07-29 | Paper |
| Attacks on hard instances of graph isomorphism | 2008-06-18 | Paper |
| Efficient techniques for network attack identification | 2008-02-20 | Paper |
| Centrality based community discovery | 2008-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3446271 | 2007-06-14 | Paper |
| Linear-time algorithms for encoding trees as sequences of node labels | 2007-04-02 | Paper |
| Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs | 2007-04-02 | Paper |
| Evolution in web graphs | 2007-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3423990 | 2007-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3378231 | 2006-03-30 | Paper |
| One-factors and Hamiltonian paths in modeling data and parity placement in disk arrays | 2006-03-30 | Paper |
| Searching for spreads and packings | 2005-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677936 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677976 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677982 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826140 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4810367 | 2004-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472697 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470369 | 2004-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464785 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464794 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430864 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430869 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430846 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430882 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414560 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529501 | 2002-11-06 | Paper |
| Random-tree Diameter and the Diameter-constrained MST | 2002-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529259 | 2002-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329061 | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329049 | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771927 | 2002-02-18 | Paper |
| Random-tree diameter and the diameter-constrained MST | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728889 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949834 | 2001-09-03 | Paper |
| Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem | 2001-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526628 | 2001-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489194 | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489237 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4237086 | 1999-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395329 | 1998-12-16 | Paper |
| Parallel dictionaries using AVL trees | 1998-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389767 | 1998-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393370 | 1998-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393323 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393333 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393289 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386084 | 1998-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4363166 | 1998-01-05 | Paper |
| Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine | 1997-02-27 | Paper |
| Metric graphs elastically embeddable in the plane | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893469 | 1996-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862889 | 1996-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4308531 | 1995-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304367 | 1994-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139726 | 1994-06-12 | Paper |
| An optimal parallel algorithm for merging using multiselection | 1994-06-09 | Paper |
| Reverse binary graphs | 1994-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4029985 | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028253 | 1993-03-28 | Paper |
| Stirling networks: A versatile combinatorial topology for multiprocessor systems | 1993-01-16 | Paper |
| Parallel algorithms for terminal-pair reliability | 1993-01-16 | Paper |
| The knapsack problem with disjoint multiple-choice constraints | 1992-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972133 | 1992-06-25 | Paper |
| Parallel algorithms for merging and sorting | 1991-01-01 | Paper |
| Parallel graph algorithms for hypercube computers | 1990-01-01 | Paper |
| Two minimum spanning forest algorithms on fixed-size hypercube computers | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035314 | 1990-01-01 | Paper |
| Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355234 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3834064 | 1988-01-01 | Paper |
| Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770572 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035338 | 1987-01-01 | Paper |
| An upper bound for the speedup of parallel best-bound branch-and-bound algorithms | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760580 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773360 | 1985-01-01 | Paper |
| On the power of a perturbation for testing non-isomorphism of graphs | 1984-01-01 | Paper |
| Shortest-path algorithms: Taxonomy and annotation | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683547 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3330526 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310647 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693257 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3314987 | 1983-01-01 | Paper |
| Algorithms for Generating Fundamental Cycles in a Graph | 1982-01-01 | Paper |
| Parallel algorithms for the single source shortest path problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3930653 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936208 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340861 | 1980-01-01 | Paper |
| Node-Deletion NP-Complete Problems | 1979-01-01 | Paper |
| Complexity of the minimum-dummy-activities problem in a pert network | 1979-01-01 | Paper |
| Interference in Multiprocessor Systems with Localized Memory Access Probabilities | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144192 | 1977-01-01 | Paper |
| Generalizations of line graphs and applications | 1977-01-01 | Paper |
| Note on Hopcroft and Tarjan's Planarity Algorithm | 1976-01-01 | Paper |
| On Algorithms for Enumerating All Circuits of a Graph | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770975 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050643 | 1973-01-01 | Paper |
| Existence of Four Concurrent Normals to a Smooth Closed Curve | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636909 | 1969-01-01 | Paper |
| Generalized Parallel Redundancy in Digital Computers | 1968-01-01 | Paper |
| Impact Printing | 1966-01-01 | Paper |
