| Publication | Date of Publication | Type |
|---|
| Shannon capacity, Lovász theta number and the Mycielski construction | 2025-01-23 | Paper |
| Shannon capacity, Lov\'asz theta number and the Mycielski construction | 2023-12-14 | Paper |
| On multichromatic numbers of widely colorable graphs | 2023-10-05 | Paper |
| Structured Codes of Graphs | 2023-03-30 | Paper |
| Critical subgraphs of Schrijver graphs for the fractional chromatic number | 2022-12-19 | Paper |
| Partitioning transitive tournaments into isomorphic digraphs | 2021-06-24 | Paper |
| On colorful edge triples in edge-colored complete graphs | 2021-03-17 | Paper |
| Shannon capacity and the categorical product | 2021-03-17 | Paper |
| On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges | 2021-01-25 | Paper |
| Dilworth Rate: A Generalization of Witsenhausen’s Zero-Error Rate for Directed Graphs | 2017-04-28 | Paper |
| Orientations making \(k\)-cycles cyclic | 2017-01-13 | Paper |
| Perfection, imperfection, and graph entropy | 2016-07-01 | Paper |
| Relations between the Local Chromatic Number and Its Directed Version | 2015-07-23 | Paper |
| A generalization of Witsenhausen's zero-error rate for directed graphs | 2014-06-03 | Paper |
| Local chromatic number of quadrangulations of surfaces | 2014-03-17 | Paper |
| Families of very different paths | 2013-11-01 | Paper |
| Permutation capacities and oriented infinite paths | 2013-11-01 | Paper |
| Colourful theorems and indices of homomorphism complexes | 2013-06-07 | Paper |
| Gallai colorings and domination in multipartite digraphs | 2012-11-23 | Paper |
| Families of graph-different Hamilton paths | 2012-08-22 | Paper |
| Permutation capacities of families of oriented infinite paths | 2011-04-15 | Paper |
| On directed local chromatic number, shift graphs, and Borsuk-like graphs | 2011-01-20 | Paper |
| On topological relaxations of chromatic conjectures | 2010-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576721 | 2010-07-30 | Paper |
| On types of growth for graph-different permutations | 2009-06-17 | Paper |
| Graph-Different Permutations | 2009-05-27 | Paper |
| Necklace bisection with one cut less than needed | 2009-04-07 | Paper |
| Local chromatic number and distinguishing the strength of topological obstructions | 2009-02-25 | Paper |
| On Witsenhausen's zero-error rate for multiple sources | 2008-12-21 | Paper |
| Colorful subgraphs in Kneser-like graphs | 2007-11-21 | Paper |
| Local chromatic number, Ky Fan's theorem, and circular colorings | 2007-05-08 | Paper |
| Asymptotic values of the Hall-ratio for graph powers | 2006-10-30 | Paper |
| Local chromatic number and Sperner capacity | 2005-09-28 | Paper |
| Connected matchings and Hadwiger's conjecture | 2005-06-07 | Paper |
| Edge colorings of complete graphs without tricolored triangles | 2004-08-04 | Paper |
| Perfect graphs and graph entropy: An updated survey | 2002-08-08 | Paper |
| Graph pairs and their entropies: Modularity problems | 2001-04-01 | Paper |
| Intersecting set systems and graphic matroids | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263485 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263475 | 1999-11-21 | Paper |
| Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities | 1999-02-17 | Paper |
| Recovering Set Systems and Graph Entropy | 1998-03-08 | Paper |
| Entropy splitting hypergraphs | 1997-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878288 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871067 | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840778 | 1995-12-11 | Paper |
| Different capacities of a digraph | 1994-09-26 | Paper |
| On the optimal structure of recovering set pairs in lattices: The sandglass conjecture | 1994-06-14 | Paper |
| Perfect couples of graphs | 1993-01-16 | Paper |
| A Sperner-type theorem and qualitative independence | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977587 | 1992-06-25 | Paper |
| Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory | 1991-01-01 | Paper |
| Entropy splitting for antiblocking corners and perfect graphs | 1990-01-01 | Paper |
| Coding for write-unidirectional memories and conflict resolution | 1989-01-01 | Paper |
| On write-unidirectional memory codes | 1989-01-01 | Paper |
| Separating Partition Systems and Locally Different Sequences | 1988-01-01 | Paper |
