| Publication | Date of Publication | Type |
|---|
| Rank bounds and integrality gaps for cutting planes procedures | 2026-05-29 | Paper |
An Infinite Family of Counterexamples to a Conjecture on Distance Magic Labeling
Experimental Mathematics | 2026-03-25 | Paper |
The non-backtracking spectrum of the universal cover of a graph
Transactions of the American Mathematical Society | 2015-04-22 | Paper |
Rank bounds and integrality gaps for cutting planes procedures
Theory of Computing | 2011-05-24 | Paper |
On the girth of random Cayley graphs
Random Structures & Algorithms | 2010-11-09 | Paper |
On Extending Bounded Proofs to Inductive Proofs
Computer Aided Verification | 2009-06-30 | Paper |
Finding the Rare Cube
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Expander graphs and their applications
Bulletin of the American Mathematical Society | 2008-07-21 | Paper |
Simple permutations mix even better
Random Structures & Algorithms | 2008-06-05 | Paper |
Monotone Circuits for the Majority Function
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
A Note on Unsatisfiable <i>k</i>-CNF Formulas with Few Occurrences per Variable
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Maximum matchings in regular graphs of high girth
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Maximum matchings in regular graphs of high girth
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Simple permutations mix well
Theoretical Computer Science | 2006-01-09 | Paper |
A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex
Journal of Combinatorial Theory. Series B | 2005-11-22 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
Theoretical Computer Science | 2005-06-30 | Paper |
A lower bound on the spectral radius of the universal cover of a graph
Journal of Combinatorial Theory. Series B | 2005-02-09 | Paper |
Colorings of the \(d\)-regular infinite tree
Journal of Combinatorial Theory. Series B | 2004-08-06 | Paper |
On codes from hypergraphs.
European Journal of Combinatorics | 2004-03-14 | Paper |
The size of bipartite graphs with a given girth
Journal of Combinatorial Theory. Series B | 2003-08-20 | Paper |
A continuous analogue of the girth problem
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
The Moore bound for irregular graphs
Graphs and Combinatorics | 2002-05-14 | Paper |
Central points for sets in \(\mathbb{R}^ n\) (or: the chocolate ice-cream problem)
Discrete & Computational Geometry | 1996-07-29 | Paper |
Universal traversal sequences for expander graphs
Information Processing Letters | 1993-08-08 | Paper |
An infinite family of counterexamples to a conjecture on distance magic labeling
(available as arXiv preprint) | N/A | Paper |
On the Girth of Graph Lifts
(available as arXiv preprint) | N/A | Paper |
