| Publication | Date of Publication | Type |
|---|
| Data transfers in broadcast networks | 2018-09-14 | Paper |
| Orienting graphs to optimize reachability | 2016-06-01 | Paper |
| Sufficient degree conditions fork-edge-connectedness of a graph | 2010-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615980 | 2009-03-24 | Paper |
| Improved bounds for the chromatic number of a graph | 2005-02-16 | Paper |
| Bounds for the chromatic number of graphs with partial information | 2003-04-09 | Paper |
| Locations on time-varying networks | 2001-07-09 | Paper |
| Improved bounds for the chromatic index of graphs and multigraphs | 2000-04-09 | Paper |
| Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs | 1997-11-09 | Paper |
| Locating replicas of a database on a network | 1997-09-21 | Paper |
| Gossiping with multiple sends and receives | 1997-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284598 | 1997-01-22 | Paper |
| Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem | 1996-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873682 | 1996-04-17 | Paper |
| Star arboricity of graphs | 1996-03-25 | Paper |
| Degree‐bounded coloring of graphs: Variations on a theme by brooks | 1995-10-31 | Paper |
| Fitting polygonal functions to a set of points in the plane | 1995-03-09 | Paper |
| Edge-disjoint packings of graphs | 1994-06-08 | Paper |
| Parallel Information Dissemination by Packets | 1994-05-10 | Paper |
| Approximation algorithms for the capacitated plant allocation problem | 1994-01-01 | Paper |
| Information dissemination in distributed systems with faulty units | 1994-01-01 | Paper |
| On locating path- or tree-shaped facilities on networks | 1993-12-12 | Paper |
| The Voronoi Partition of a Network and Its Implications in Location Theory | 1993-02-25 | Paper |
| Sequential information dissemination by packets | 1993-01-16 | Paper |
| On a general network location--production--allocation problem | 1992-06-28 | Paper |
| Market and Locational Equilibrium for Two Competitors | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971522 | 1992-06-25 | Paper |
| Parallel algorithms for gossiping by mail | 1990-01-01 | Paper |
| Recognizing tough graphs is NP-hard | 1990-01-01 | Paper |
| River Routing with a Small Number of Jogs | 1990-01-01 | Paper |
| A Note on the Vertex Arboricity of a Graph | 1989-01-01 | Paper |
| A cycle structure theorem for Hamiltonian graphs | 1988-01-01 | Paper |
| On computing a conditional edge-connectivity of a graph | 1988-01-01 | Paper |
| Data transfers in networks | 1988-01-01 | Paper |
| The complexity of searching a graph | 1988-01-01 | Paper |
| Design of multi-input multi-output systems with minimum sensitivity | 1988-01-01 | Paper |
| Chromatic factorizations of a graph | 1988-01-01 | Paper |
| Data transfers in networks with transceivers | 1988-01-01 | Paper |
| Scheduling File Transfers for Trees and Odd Cycles | 1987-01-01 | Paper |
| Data transfers in networks with transceivers | 1987-01-01 | Paper |
| System-level diagnosis: analysis of two new models | 1986-01-01 | Paper |
| A generalization of edge-coloring in graphs | 1986-01-01 | Paper |
| Fault-Tolerant Routing in DeBruijn Comrnunication Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691756 | 1985-01-01 | Paper |
| On a theory of t-fault diagnosable analog systems | 1984-01-01 | Paper |
| An adaptive algorithm for system level diagnosis | 1984-01-01 | Paper |
| On Adaptive System Diagnosis | 1984-01-01 | Paper |
| On computing the connectivities of graphs and digraphs | 1984-01-01 | Paper |
| On locating new facilities in a competitive environment | 1983-01-01 | Paper |
| The Maximum Coverage Location Problem | 1983-01-01 | Paper |
| Bounds on the number of cycles of length three in a planar graph | 1982-01-01 | Paper |
| Complexity results for scheduling tasks with discrete starting times | 1982-01-01 | Paper |
| Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines | 1982-01-01 | Paper |
| On structured digraphs and program testing | 1981-01-01 | Paper |
| On Fault Identification in Diagnosable Systems | 1981-01-01 | Paper |
| On the complexity of some coding problems (Corresp.) | 1981-01-01 | Paper |
| Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741698 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893295 | 1980-01-01 | Paper |
| On the number of hamiltonian cycles in a maximal planar graph | 1979-01-01 | Paper |
| An Algorithmic Approach to Network Location Problems. I: Thep-Centers | 1979-01-01 | Paper |
| An Algorithmic Approach to Network Location Problems. II: Thep-Medians | 1979-01-01 | Paper |
| On the number of cycles of lengthk in a maximal planar graph | 1979-01-01 | Paper |
| On Path Cover Problems in Digraphs and Applications to Program Testing | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156463 | 1978-01-01 | Paper |
| On the connectivity of maximal planar graphs | 1978-01-01 | Paper |
| On Planar Graphical Degree Sequences | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180395 | 1977-01-01 | Paper |
| Relations between graphs and integer-pair sequences | 1976-01-01 | Paper |
| On Models for Diagnosable Systems and Probabilistic Fault Diagnosis | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116056 | 1976-01-01 | Paper |
| Pancyclic graphs and a conjecture of Bondy and Chvatal | 1974-01-01 | Paper |
| Characterization of Connection Assignment of Diagnosable Systems | 1974-01-01 | Paper |
| On the Existence of Graphs with Prescribed Degrees and Connectivity | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5684711 | 1974-01-01 | Paper |
| On the design of reliable networks | 1973-01-01 | Paper |
| The distance matrix of a graph and its tree realization | 1972-01-01 | Paper |
| Optimum Locations of Centers in Networks | 1972-01-01 | Paper |
| Upper Bounds on the Order of a Clique of a Graph | 1972-01-01 | Paper |
| Graph theoretic<tex>q</tex>-ary codes (Corresp.) | 1971-01-01 | Paper |
| Steiner's problem in graphs and its implications | 1971-01-01 | Paper |
| Analysis and design of communication networks with memory | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044430 | 1969-01-01 | Paper |
| Ternary graph theoretic error-correcting codes (Corresp.) | 1969-01-01 | Paper |
| A Graph-Theoretic Approach to a Class of Integer-Programming Problems | 1969-01-01 | Paper |
| Graph theoretic prefix codes and their synchronizing properties | 1969-01-01 | Paper |
| Graph theoretic error-correcting codes | 1968-01-01 | Paper |
| Decoding of graph theoretic codes (Corresp.) | 1967-01-01 | Paper |
| On the degrees of the vertices of a directed graph | 1965-01-01 | Paper |
| Distance matrix of a graph and its realizability | 1965-01-01 | Paper |
| Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems | 1965-01-01 | Paper |
| Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph | 1964-01-01 | Paper |
| On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness | 1963-01-01 | Paper |
| On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5555549 | 1962-01-01 | Paper |
| On trees of a graph and their generation | 1961-01-01 | Paper |
| Graphs with two kinds of elements | 1960-01-01 | Paper |
