| Publication | Date of Publication | Type |
|---|
Metric dimension of growing infinite graphs
Journal of Combinatorics | 2024-01-26 | Paper |
On combinatorial properties of binary spaces
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
On reconfiguration graphs: an abstraction
| 2022-02-08 | Paper |
The threshold dimension and threshold strong dimension of a graph: a survey
| 2022-02-01 | Paper |
The threshold strong dimension of a graph
Discrete Mathematics | 2021-06-14 | Paper |
Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom
Mathematical Social Sciences | 2021-04-26 | Paper |
On ideal clutters, metrics and multiflows
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Reconfiguration graphs of shortest paths
Discrete Mathematics | 2018-08-15 | Paper |
What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments
The American Mathematical Monthly | 2018-07-12 | Paper |
An ABC-problem for location and consensus functions on graphs
Discrete Applied Mathematics | 2016-06-01 | Paper |
Five axioms for location functions on median graphs
Discrete Mathematics, Algorithms and Applications | 2015-07-01 | Paper |
A tight axiomatization of the median procedure on median graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
scientific article; zbMATH DE number 6096647 (Why is no real title available?)
| 2012-10-21 | Paper |
An axiomatization of the median procedure on the \(n\)-cube
Discrete Applied Mathematics | 2011-06-01 | Paper |
Edge closures of Hamiltonian type
| 2010-09-02 | Paper |
On irreducible no‐hole L(2, 1)‐coloring of trees
Networks | 2009-07-28 | Paper |
Norm statistics and the complexity of clustering problems
Discrete Applied Mathematics | 2009-06-24 | Paper |
Turán theorems and convexity invariants for directed graphs
Discrete Mathematics | 2008-09-04 | Paper |
Fault tolerance of Cayley graphs
Annals of Combinatorics | 2007-10-11 | Paper |
Vertex orderings of graphs: an overview
| 2007-04-02 | Paper |
From Hall's matching theorem to optimal routing on hypercubes
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
scientific article; zbMATH DE number 1161303 (Why is no real title available?)
| 1998-11-08 | Paper |
Ideal 0, 1 matrices
Journal of Combinatorial Theory. Series B | 1994-06-06 | Paper |
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
Discrete Applied Mathematics | 1986-01-01 | Paper |
