| Publication | Date of Publication | Type |
|---|
| Quasi-random Boolean functions | 2024-07-18 | Paper |
| Forest formulas of discrete Green's functions | 2023-10-06 | Paper |
| A random graph model for clustering graphs | 2023-10-04 | Paper |
| Quasi-Random Influences of Boolean Functions | 2022-09-08 | Paper |
| Fan-complete Ramsey numbers | 2022-08-11 | Paper |
| Solving local linear systems with boundary conditions using heat kernel pagerank | 2021-04-26 | Paper |
| A local clustering algorithm for connection graphs | 2021-04-26 | Paper |
| Permanental generating functions and sequential importance sampling | 2021-04-23 | Paper |
| Hypergraph Coloring Games and Voter Models | 2021-04-23 | Paper |
| Ranking and sparsifying a connection graph | 2021-04-23 | Paper |
| Regularity lemmas for clustering graphs | 2021-04-23 | Paper |
| Multicommodity allocation for dynamic demands using PageRank vectors | 2021-04-23 | Paper |
| Efficient packings of unit squares in a large square | 2020-10-23 | Paper |
| Slow Fibonacci walks | 2020-01-31 | Paper |
| A semi-supervised heat kernel pagerank MBO algorithm for data classification | 2018-12-20 | Paper |
| The maximum relaxation time of a random walk | 2018-10-16 | Paper |
| The Digraph Drop Polynomial | 2018-10-09 | Paper |
| Sum sequences modulo \(n\) | 2018-07-18 | Paper |
| Well dispersed sequences in \([0,1]^{d}\) | 2018-05-02 | Paper |
| A strong Harnack inequality for graphs | 2018-01-09 | Paper |
| Computing heat kernel PageRank and a local clustering algorithm | 2017-11-14 | Paper |
| Descent polynomials for permutations with bounded drop size | 2017-11-14 | Paper |
| Juggling card sequences | 2017-09-20 | Paper |
| The drop polynomial of a weighted digraph | 2017-08-22 | Paper |
| The spectral gap of graphs arising from substring reversals | 2017-07-26 | Paper |
| Curvature aspects of graphs | 2017-02-22 | Paper |
| Extreme values of the stationary distribution of random walks on directed graphs | 2016-12-28 | Paper |
| A near optimal algorithm for edge separators (preliminary version) | 2016-09-01 | Paper |
| A generalized Alon-Boppana bound and weak Ramanujan graphs | 2016-07-13 | Paper |
| The matrix cover polynomial | 2016-05-25 | Paper |
| Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions | 2016-05-04 | Paper |
| On the discrepancy of circular sequences of reals | 2016-04-13 | Paper |
| Decomposition of random graphs into complete bipartite graphs | 2016-02-19 | Paper |
| Distributed algorithms for finding local clusters using heat kernel PageRank | 2016-01-08 | Paper |
| Computing heat kernel Pagerank and a local clustering algorithm | 2015-09-15 | Paper |
| Edge flipping in the complete graph | 2015-08-21 | Paper |
| Routing permutations on graphs via matchings | 2015-05-07 | Paper |
| Harnack inequalities for graphs with non-negative Ricci curvature | 2015-03-27 | Paper |
| A few words on research for graduate students | 2015-02-25 | Paper |
| Single-processor scheduling with time restrictions | 2015-01-22 | Paper |
| Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank | 2015-01-13 | Paper |
| A Local Clustering Algorithm for Connection Graphs | 2015-01-13 | Paper |
| A random graph model for massive graphs | 2014-09-26 | Paper |
| Discrepancy inequalities for directed graphs | 2014-08-29 | Paper |
| A note on an alternating upper bound for random walks on semigroups | 2014-08-29 | Paper |
| From quasirandom graphs to graph limits and graphlets | 2014-08-28 | Paper |
| Generalized Eulerian sums | 2014-04-11 | Paper |
| Computer networks | 2014-02-21 | Paper |
| Dirichlet PageRank and ranking algorithms based on trust and distrust | 2013-06-28 | Paper |
| Inversion-descent polynomials for restricted permutations | 2013-01-10 | Paper |
| Braess's paradox in expanders | 2012-12-14 | Paper |
| PageRank as a discrete Green's function | 2012-11-08 | Paper |
| From continues to discrete - Yau's work on graph theory | 2012-11-08 | Paper |
| Finding and visualizing graph clusters using PageRank optimization | 2012-08-29 | Paper |
| Ranking and sparsifying a connection graph | 2012-07-23 | Paper |
| Hypergraph Coloring Games and Voter Models | 2012-07-23 | Paper |
| Multi-commodity allocation for dynamic demands using PageRank vectors | 2012-07-23 | Paper |
| Diameter of random spanning trees in a given graph | 2012-06-13 | Paper |
| Percolation in general graphs | 2012-04-18 | Paper |
| A local graph partitioning algorithm using heat kernel pagerank | 2012-04-18 | Paper |
| Quasi-random hypergraphs revisited | 2012-03-07 | Paper |
| Small spectral gap in the combinatorial Laplacian implies Hamiltonian | 2012-01-24 | Paper |
| Edge flipping in graphs | 2011-12-08 | Paper |
| On the spectra of general random graphs | 2011-11-22 | Paper |
| The Spectral Gap of a Random Subgraph of a Graph | 2011-06-21 | Paper |
| Dirichlet PageRank and trust-based ranking algorithms | 2011-06-08 | Paper |
| Local partitioning for directed graphs using pagerank | 2011-02-28 | Paper |
| The spectral gap of a random subgraph of a graph | 2011-02-28 | Paper |
| Four proofs for the Cheeger inequality and graph partition algorithms | 2011-02-18 | Paper |
| Distributing antidote using PageRank vectors | 2011-01-31 | Paper |
| Finding and visualizing graph clusters using PageRank optimization | 2011-01-21 | Paper |
| A sharp PageRank algorithm with applications to edge ranking and graph sparsification | 2011-01-21 | Paper |
| \texttt{PageRank} and random walks on graphs | 2010-12-13 | Paper |
| Tiling polygons with lattice triangles | 2010-11-08 | Paper |
| Descent polynomials for permutations with bounded drop size | 2010-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747946 | 2010-09-14 | Paper |
| A symmetrical Eulerian identity | 2010-08-30 | Paper |
| Packing equal squares into a large square | 2009-11-26 | Paper |
| Classification of weighted dual graphs with only complete intersection singularities structures | 2009-06-22 | Paper |
| Using PageRank to Locally Partition a Graph | 2009-04-28 | Paper |
| Primitive Juggling Sequences | 2009-02-26 | Paper |
| A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank | 2009-02-10 | Paper |
| The Giant Component in a Random Subgraph of a Given Graph | 2009-02-10 | Paper |
| Local Partitioning for Directed Graphs Using PageRank | 2008-04-11 | Paper |
| Quasi‐random graphs with given degree sequences | 2008-01-18 | Paper |
| Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm | 2007-11-13 | Paper |
| Oblivious and adaptive strategies for the majority and plurality problems | 2007-10-10 | Paper |
| Universal juggling cycles | 2007-08-22 | Paper |
| The Volume of the Giant Component of a Random Graph with Given Expected Degrees | 2007-05-22 | Paper |
| Drawing power law graphs using a local/global decomposition | 2007-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433952 | 2007-04-23 | Paper |
| Random walks and local cuts in graphs | 2007-04-18 | Paper |
| Concentration Inequalities and Martingale Inequalities: A Survey | 2007-04-05 | Paper |
| Parallelism versus memory allocation in pipelined router forwarding engines | 2007-01-25 | Paper |
| Weighted Laplacians and the sigma function of a graph | 2007-01-08 | Paper |
| Maximizing data locality in distributed systems | 2006-12-07 | Paper |
| Complex graphs and networks | 2006-09-29 | Paper |
| Explicit construction of linear sized tolerant networks. (Reprint) | 2006-08-04 | Paper |
| Modeling the Small-World Phenomenon with Local Network Flow | 2006-06-26 | Paper |
| The diameter and Laplacian eigenvalues of directed graphs | 2006-03-22 | Paper |
| The small world phenomenon in hybrid power law graphs | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| A Spectral Turán Theorem | 2005-11-14 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| The average distances in random graphs with given expected degrees | 2005-07-19 | Paper |
| Spectra of random graphs with given expected degrees | 2005-07-19 | Paper |
| De Bruijn Covering Codes for Rooted Hypergraphs | 2005-05-25 | Paper |
| The Average Distance in a Random Graph with Given Expected Degrees | 2005-05-09 | Paper |
| The Spectra of Random Graphs with Given Expected Degrees | 2005-05-03 | Paper |
| Coupling Online and Offline Analyses for Random Power Law Graphs | 2005-05-03 | Paper |
| Laplacians and the Cheeger inequality for directed graphs | 2005-04-28 | Paper |
| Guessing Secrets with Inner Product Questions | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3160533 | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828939 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459542 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432305 | 2003-12-08 | Paper |
| De Bruijn Cycles for Covering Codes | 2003-10-23 | Paper |
| Generalizations of Polya's urn problem | 2003-09-16 | Paper |
| Eigenvalues of random power law graphs | 2003-08-14 | Paper |
| Connected components in random graphs with given expected degree sequences | 2003-03-27 | Paper |
| Combinatorics for the East model | 2003-03-13 | Paper |
| Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs | 2002-12-09 | Paper |
| A chip-firing game and Dirichlet eigenvalues | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552043 | 2002-11-11 | Paper |
| Sparse quasi-random graphs | 2002-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524309 | 2002-09-16 | Paper |
| Distance realization problems with applications to internet tomography | 2002-07-04 | Paper |
| Guessing secrets. (Extended abstract) | 2002-01-30 | Paper |
| The diameter of sparse random graphs | 2002-01-08 | Paper |
| Dynamic location problems with limited look-ahead | 2001-08-23 | Paper |
| A Random Graph Model for Power Law Graphs | 2001-07-22 | Paper |
| Discrete Green's functions | 2001-06-19 | Paper |
| Guessing secrets | 2001-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527044 | 2001-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506065 | 2001-01-29 | Paper |
| On polynomials of spanning trees | 2000-11-05 | Paper |
| An upper bound for the Turán number \(t_3(n,4)\) | 2000-10-23 | Paper |
| Weighted graph Laplacians and isoperimetric inequalities | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941238 | 2000-05-29 | Paper |
| Multidiameters and multiplicities | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256582 | 1999-07-25 | Paper |
| Isoperimetric Inequalities for Cartesian Products of Graphs | 1999-04-23 | Paper |
| Coverings, heat kernels and spanning trees | 1999-03-08 | Paper |
| Eigenvalue inequalities for graphs and convex subgraphs | 1998-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358742 | 1998-06-29 | Paper |
| Forced convex \(n\)-gons in the plane | 1998-06-08 | Paper |
| Stratified random walks on then-cube | 1998-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382659 | 1998-03-22 | Paper |
| Random walks on generating sets for finite groups | 1998-02-15 | Paper |
| A tribute to Herbert S. Wilf in celebration of his 65th birthday | 1998-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358743 | 1998-01-22 | Paper |
| Optimal emulations by butterfly-like networks | 1998-01-21 | Paper |
| Logarithmic Harnack inequalities | 1998-01-08 | Paper |
| Open problems of Paul Erd�s in graph theory | 1997-07-22 | Paper |
| A combinatorial Laplacian with vertex weights | 1997-07-20 | Paper |
| On sampling with Markov chains | 1997-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785584 | 1997-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4716782 | 1997-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5691133 | 1997-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4869233 | 1996-09-01 | Paper |
| Pebbling a Chessboard | 1996-08-22 | Paper |
| Eigenvalues of Graphs and Sobolev Inequalities | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866083 | 1996-07-28 | Paper |
| Maximum subsets of \((0,1]\) with no solutions to \(x+y = kz\) | 1996-07-21 | Paper |
| On the cover polynomial of a digraph | 1996-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878659 | 1996-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873809 | 1996-04-22 | Paper |
| Upper bounds for eigenvalues of the discrete and continuous Laplace operators | 1996-03-27 | Paper |
| Salvage-Embeddings of Complete Trees | 1996-02-20 | Paper |
| A Harnack inequality for homogeneous graphs and subgraphs | 1995-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697451 | 1995-10-08 | Paper |
| Routing Permutations on Graphs via Matchings | 1995-05-14 | Paper |
| Chordal completions of planar graphs | 1995-03-20 | Paper |
| An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian | 1995-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321946 | 1995-02-07 | Paper |
| Several generalizations of Weil sums | 1994-10-12 | Paper |
| On hypergraphs having evenly distributed subhypergraphs | 1994-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273621 | 1994-01-13 | Paper |
| Even Cycles in Directed Graphs | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138285 | 1993-12-15 | Paper |
| Communication Complexity and Quasi Randomness | 1993-06-29 | Paper |
| Universal cycles for combinatorial structures | 1993-05-16 | Paper |
| Cohomological Aspects of Hypergraphs | 1993-04-01 | Paper |
| A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\) | 1993-03-10 | Paper |
| Graphs with small diameter after edge deletion | 1993-01-16 | Paper |
| Laplacian and vibrational spectra for homogeneous graphs | 1992-12-17 | Paper |
| Quasi-random subsets of \(\mathbb{Z}_ n\) | 1992-10-05 | Paper |
| Subgraphs of a hypercube containing no small even cycles | 1992-09-27 | Paper |
| The number of different distances determined by a set of points in the Euclidean plane | 1992-06-28 | Paper |
| Efficient Embeddings of Trees in Hypercubes | 1992-06-28 | Paper |
| A Note on Finding a Strict Saddlepoint | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972950 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976404 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972308 | 1992-06-25 | Paper |
| Quasi‐random classes of hypergraphs | 1992-06-25 | Paper |
| Quasi-Random Set Systems | 1992-06-25 | Paper |
| Regularity lemmas for hypergraphs and quasi-randomness | 1992-06-25 | Paper |
| Partitioning circuits for improved testability | 1991-01-01 | Paper |
| Quasi-random tournaments | 1991-01-01 | Paper |
| The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree | 1990-01-01 | Paper |
| Quasi-random hypergraphs | 1990-01-01 | Paper |
| Universal graphs and induced-universal graphs | 1990-01-01 | Paper |
| Quasi-random graphs | 1989-01-01 | Paper |
| A dynamic location problem for graphs | 1989-01-01 | Paper |
| Pebbling in Hypercubes | 1989-01-01 | Paper |
| Diameters and Eigenvalues | 1989-01-01 | Paper |
| Universal Graphs for Bounded-Degree Trees and Planar Graphs | 1989-01-01 | Paper |
| Optical orthogonal codes: design, analysis and applications | 1989-01-01 | Paper |
| Quasi-random hypergraphs | 1989-01-01 | Paper |
| Graphs with small bandwidth and cutwidth | 1989-01-01 | Paper |
| Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs | 1989-01-01 | Paper |
| Steiner Trees on a Checkerboard | 1989-01-01 | Paper |
| On induced subgraphs of the cube | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3803160 | 1988-01-01 | Paper |
| Explicit construction of linear sized tolerant networks | 1988-01-01 | Paper |
| The Diameter of a Cycle Plus a Random Matching | 1988-01-01 | Paper |
| The average distance and the independence number | 1988-01-01 | Paper |
| Self-organizing sequential search and Hilbert's inequalities | 1988-01-01 | Paper |
| Pursuit—Evasion games on graphs | 1988-01-01 | Paper |
| On the Fractional Covering Number of Hypergraphs | 1988-01-01 | Paper |
| Quasi-random graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470486 | 1987-01-01 | Paper |
| Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design | 1987-01-01 | Paper |
| Random walks arising in random number generation | 1987-01-01 | Paper |
| Highly irregular graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785965 | 1987-01-01 | Paper |
| The forwarding index of communication networks | 1987-01-01 | Paper |
| The maximum number of edges in a 3-graph not containing a given star | 1987-01-01 | Paper |
| On unavoidable hypergraphs | 1987-01-01 | Paper |
| Some intersection theorems for ordered sets and graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727877 | 1986-01-01 | Paper |
| Monotone subsequences in (0,1)-matrices | 1986-01-01 | Paper |
| Minced trees, with applications to fault-tolerant VLSI processor arrays | 1986-01-01 | Paper |
| Strongly connected orientations of mixed multigraphs | 1985-01-01 | Paper |
| On the addressing problem for directed graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689203 | 1985-01-01 | Paper |
| On the Cutwidth and the Topological Bandwidth of a Tree | 1985-01-01 | Paper |
| Extremal subgraphs for two graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691751 | 1985-01-01 | Paper |
| Cross-monotone subsequences | 1985-01-01 | Paper |
| Quantitative forms of a theorem of Hilbert | 1985-01-01 | Paper |
| Coding Strings by Pairs of Strings | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680931 | 1984-01-01 | Paper |
| Diameter bounds for altered graphs | 1984-01-01 | Paper |
| The number of different distances determined by n points in the plane | 1984-01-01 | Paper |
| Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs | 1984-01-01 | Paper |
| On optimal linear arrangements of trees | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679224 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679223 | 1984-01-01 | Paper |
| On Universal Graphs for Spanning Trees | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312268 | 1983-01-01 | Paper |
| A survey of bounds for classical Ramsey numbers | 1983-01-01 | Paper |
| Edge-colored complete graphs with precisely colored subgraphs | 1983-01-01 | Paper |
| On unavoidable graphs | 1983-01-01 | Paper |
| Unavoidable stars in 3-graphs | 1983-01-01 | Paper |
| On a Ramsey-type problem | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218156 | 1983-01-01 | Paper |
| Perfect Storage Representations for Families of Data Structures | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329369 | 1983-01-01 | Paper |
| On Packing Two-Dimensional Bins | 1982-01-01 | Paper |
| On Graphs Which Contain All Sparse Graphs | 1982-01-01 | Paper |
| Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs | 1982-01-01 | Paper |
| Tiling Rectangles with Rectangles | 1982-01-01 | Paper |
| On the Decomposition of Graphs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3915022 | 1981-01-01 | Paper |
| On Steiner trees for bounded point sets | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919742 | 1981-01-01 | Paper |
| Minimal decompositions of graphs into mutually isomorphic subgraphs | 1981-01-01 | Paper |
| Universal caterpillars | 1981-01-01 | Paper |
| A note on constructive methods for ramsey numbers | 1981-01-01 | Paper |
| On the permanents of complements of the direct sum of identity matrices | 1981-01-01 | Paper |
| On irregularities of distribution of real sequences | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3918154 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921277 | 1981-01-01 | Paper |
| Efficient Realization Techniques for Network Flow Patterns | 1981-01-01 | Paper |
| On the coverings of graphs | 1980-01-01 | Paper |
| On unimodal subsequences | 1980-01-01 | Paper |
| On Unimodality for Linear Extensions of Partial Orders | 1980-01-01 | Paper |
| The Connection Patterns of Two Complete Binary Trees | 1980-01-01 | Paper |
| On Switching Networks and Block Designs, II | 1980-01-01 | Paper |
| On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks | 1979-01-01 | Paper |
| The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934429 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941451 | 1979-01-01 | Paper |
| On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks | 1979-01-01 | Paper |
| The number of Baxter permutations | 1978-01-01 | Paper |
| Some results on hook lengths | 1978-01-01 | Paper |
| On partitions of graphs into trees | 1978-01-01 | Paper |
| Steiner Trees for Ladders | 1978-01-01 | Paper |
| On graphs which contain all small trees | 1978-01-01 | Paper |
| A Lower Bound for the Steiner Tree Problem | 1978-01-01 | Paper |
| Do Stronger Players Win More Knockout Tournaments? | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4177609 | 1978-01-01 | Paper |
| On Blocking Probabilities for a Class of Linear Graphs | 1978-01-01 | Paper |
| Zone-Balanced Networks and Block Designs | 1978-01-01 | Paper |
| A Generalization of Takagi's Theorem on Optimal Channel Graphs | 1978-01-01 | Paper |
| On Blocking Probabilities for Switching Networks | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138658 | 1977-01-01 | Paper |
| A problem on blocking probabilities in connecting networks | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121968 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4120590 | 1976-01-01 | Paper |
| On multicolor Ramsey numbers for complete bipartite graphs | 1975-01-01 | Paper |
| Optimal Rearrangeable Graphs | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4085753 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4053693 | 1974-01-01 | Paper |
| On the Ramsey numbers N(3,3,\dots ,3;2) | 1973-01-01 | Paper |
