Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Saturated chains of subsets and a random walk
Journal of Combinatorial Theory Series A
Paths in k-edge-connected graphs
Journal of Combinatorial Theory Series B
Cycles and paths through specified vertices in k-connected graphs
Journal of Combinatorial Theory Series B
Log-concavity and combinatorial properties of Fibonacci lattices
European Journal of Combinatorics
Representations of graphs modulo n
Journal of Graph Theory
Long symmetric chains in the Boolean lattice
Journal of Combinatorial Theory Series A
Journal of Combinatorial Theory Series A
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the Neggers-Stanley conjecture and the Eulerian polynomials
Journal of Combinatorial Theory Series A
Random Structures & Algorithms
Representations of graphs modulo n
Discrete Mathematics
Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
Sperner theory in a difference of boolean lattices
Discrete Mathematics - Kleitman and combinatorics: a celebration
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
On geometric graphs with no k pairwise parallel edges
On geometric graphs with no k pairwise parallel edges
Journal of Graph Theory
Acyclic edge colorings of graphs
Journal of Graph Theory
Efficient routing and wavelength assignment for reconfigurable WDM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |