| Publication | Date of Publication | Type |
|---|
| Distributed link scheduling in wireless networks | 2021-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305724 | 2020-08-11 | Paper |
| How long does it take for all users in a social network to choose their communities? | 2019-11-06 | Paper |
| On spectrum assignment in elastic optical tree-networks | 2019-03-11 | Paper |
| Fast gossiping by short messages | 2019-01-10 | Paper |
| Bin Packing with Colocations | 2017-04-04 | Paper |
| Round weighting problem and gathering in radio networks with symmetrical interference | 2016-07-08 | Paper |
| Well-Balanced Designs for Data Placement | 2016-05-24 | Paper |
| Finding disjoint paths in networks with star shared risk link groups | 2015-05-18 | Paper |
| Data gathering and personalized broadcasting in radio grids with interference | 2014-12-02 | Paper |
| EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS | 2014-04-25 | Paper |
| Directed acyclic graphs with the unique dipath property | 2014-01-16 | Paper |
| Optimal time data gathering in wireless networks with multidirectional antennas | 2014-01-13 | Paper |
| GATHERING RADIO MESSAGES IN THE PATH | 2013-06-11 | Paper |
| Weighted improper colouring | 2013-01-18 | Paper |
| Optimal gathering in radio grids with interference | 2012-10-11 | Paper |
| GMPLS label space minimization through hypergraph layouts | 2012-08-10 | Paper |
| Line Directed Hypergraphs | 2012-06-08 | Paper |
| Traffic grooming in bidirectional WDM ring networks | 2012-01-18 | Paper |
| Weighted Improper Colouring | 2012-01-13 | Paper |
| The α-Arboricity of Complete Uniform Hypergraphs | 2011-10-27 | Paper |
| Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4 | 2011-04-15 | Paper |
| IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS | 2010-12-15 | Paper |
| Designing Hypergraph Layouts to GMPLS Routing Strategies | 2010-02-24 | Paper |
| Optimal gathering protocols on paths under interference constraints | 2009-12-15 | Paper |
| Neighborhood Broadcasting in Hypercubes | 2008-12-05 | Paper |
| Gathering with Minimum Delay in Tree Sensor Networks | 2008-07-10 | Paper |
| Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions | 2007-11-15 | Paper |
| Traffic grooming on the path | 2007-10-02 | Paper |
| Vertex disjoint routings of cycles over tori | 2007-05-23 | Paper |
| Gathering Algorithms on Paths Under Interference Constraints | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424723 | 2007-03-05 | Paper |
| Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6 | 2006-06-01 | Paper |
| Fault tolerant on-board networks with priorities | 2006-03-24 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Hierarchical ring network design | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818867 | 2004-09-24 | Paper |
| Grooming in unidirectional rings: \(K_{4}-e\) designs | 2004-08-20 | Paper |
| Deadlock prevention by acyclic orientations | 2003-07-30 | Paper |
| On Hamilton cycle decompositions of the tensor product of complete graphs | 2003-07-29 | Paper |
| Directed virtual path layouts in ATM networks | 2003-05-14 | Paper |
| Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 | 2003-04-10 | Paper |
| On DRC‐covering of Kn by cycles | 2003-04-03 | Paper |
| Design of fault-tolerant networks for satellites (TWTA redundancy) | 2003-03-19 | Paper |
| A broadcasting protocol in line digraphs | 2002-06-30 | Paper |
| Efficient collective communciation in optical networks | 2000-08-23 | Paper |
| Symmetric flows and broadcasting in hypercubes | 1999-07-12 | Paper |
| Optimal sequential gossiping by short messages | 1998-11-03 | Paper |
| Hamilton circuits in the directed wrapped Butterfly network | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373669 | 1998-09-27 | Paper |
| Fast Gossiping by Short Messages | 1998-09-20 | Paper |
| A Note on the Dimensionality of Modified Knödel Graphs | 1997-11-20 | Paper |
| Mean eccentricities of de Bruijn networks | 1997-11-06 | Paper |
| De Bruijn and Kautz bus networks | 1997-11-06 | Paper |
| Bus interconnection networks | 1996-11-25 | Paper |
| Antepenultimate broadcasting | 1996-10-07 | Paper |
| Broadcasting and Gossiping in de Bruijn Networks | 1994-03-27 | Paper |
| On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs | 1993-12-10 | Paper |
| Connectivity of Kautz networks | 1993-10-24 | Paper |
| Broadcasting in wraparound meshes with parallel monodirectional links | 1993-01-16 | Paper |
| Table of large \(({\Delta{}}, D)\)-graphs | 1993-01-16 | Paper |
| Sparse broadcast graphs | 1992-09-27 | Paper |
| Broadcasting in Bounded Degree Graphs | 1992-06-28 | Paper |
| Minimal diameter double-loop networks: Dense optimal families | 1991-01-01 | Paper |
| Existence of resolvable path designs | 1990-01-01 | Paper |
| On resolvable mixed path designs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197858 | 1990-01-01 | Paper |
| Hamiltonian decomposition of Cayley graphs of degree 4 | 1989-01-01 | Paper |
| Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks | 1989-01-01 | Paper |
| A graph theoretical approach to equivalence of multistage interconnection networks | 1989-01-01 | Paper |
| Large fault-tolerant interconnection networks | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3350798 | 1989-01-01 | Paper |
| Induced Subgraphs of the Power of a Cycle | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793717 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827949 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3706508 | 1985-01-01 | Paper |
| On linear k-arboricity | 1984-01-01 | Paper |
| Large graphs with given degree and diameter. II | 1984-01-01 | Paper |
| Regular factors in nearly regular graphs | 1984-01-01 | Paper |
| Shortest coverings of graphs with cycles | 1983-01-01 | Paper |
| Grands Graphes De Degré Et Diamètre Fixés | 1983-01-01 | Paper |
| Tables of large graphs with given degree and diameter | 1982-01-01 | Paper |
| Sur Un Probleme Combinatoire D'Antennes En Radioastronomie II | 1982-01-01 | Paper |
| Large Graphs with Given Degree and Diameter III | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739935 | 1981-01-01 | Paper |
| Longest paths in digraphs | 1981-01-01 | Paper |
| Cycles in digraphs– a survey | 1981-01-01 | Paper |
| On the maximum number of edges in a hypergraph whose linegraph contains no cycle | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875955 | 1980-01-01 | Paper |
| Chemins Et Circuits Dans Les Graphes Orientes | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901557 | 1980-01-01 | Paper |
| Girth in digraphs | 1980-01-01 | Paper |
| Resolvable decomposition of \(K^*_n\) | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3855205 | 1979-01-01 | Paper |
| Hamiltonian Cycles in Strong Products of Graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3892270 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182550 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866156 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3872478 | 1978-01-01 | Paper |
| Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4179025 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180389 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194982 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198517 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200095 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200100 | 1978-01-01 | Paper |
| Line graphs of hypergraphs. I | 1977-01-01 | Paper |
| \(G\)-decomposition of \(K_n\), where G has four vertices or less | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175297 | 1977-01-01 | Paper |
| On a Conjecture of Chvátal on m -Intersecting Hypergraphs | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198779 | 1977-01-01 | Paper |
| Decomposition of the complete directed graph into k-circuits | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4094891 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4097307 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055664 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4078059 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103114 | 1975-01-01 | Paper |
| An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits | 1974-01-01 | Paper |
| Some Ramsey nu mbers for directed graphs | 1974-01-01 | Paper |
| Nombre Chromatique Total Du Graphe R -Parti Complet | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4049113 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214953 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5646924 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5650707 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592933 | 1970-01-01 | Paper |
