| Publication | Date of Publication | Type |
|---|
Quasi-kernels in split graphs
Discrete Applied Mathematics | 2025-01-06 | Paper |
Colorings of complements of line graphs
Journal of Graph Theory | 2023-10-04 | Paper |
Tropical Complementarity Problems and Nash Equilibria
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
| On the continuity assumption of "Finite Adaptability in Multistage Linear Optimization by Bertsimas and Caramanis | 2023-05-09 | Paper |
Algorithmic aspects of small quasi-kernels
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Envy-free division of multi-layered cakes
(available as arXiv preprint) | 2022-07-06 | Paper |
Book review of: L. Lovász, Graphs and geometry
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 2022-05-31 | Paper |
\(O_n\) is an \(n\)-MCFL
Journal of Computer and System Sciences | 2022-04-04 | Paper |
| Linear lexicographic optimization and preferential bidding system | 2022-01-21 | Paper |
Tverberg theorems over discrete sets of points
Polytopes and Discrete Geometry | 2021-07-09 | Paper |
Topological bounds for graph representations over any field
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
Minimizing the waiting time for a one-way shuttle service
Journal of Scheduling | 2020-03-10 | Paper |
Perfect graphs with polynomially computable kernels
Discrete Applied Mathematics | 2019-12-30 | Paper |
Envy-free cake division without assuming the players prefer nonempty pieces
Israel Journal of Mathematics | 2019-12-17 | Paper |
Different versions of the nerve theorem and colourful simplices
Journal of Combinatorial Theory. Series A | 2019-11-27 | Paper |
Different versions of the nerve theorem and colourful simplices
Journal of Combinatorial Theory. Series A | 2019-11-27 | Paper |
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Bulletin of the American Mathematical Society | 2019-10-30 | Paper |
| scientific article; zbMATH DE number 7121836 (Why is no real title available?) | 2019-10-24 | Paper |
Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
SIAM Journal on Applied Algebra and Geometry | 2019-09-27 | Paper |
Shared mobility systems: an updated survey
Annals of Operations Research | 2019-03-06 | Paper |
Computing solutions of the multiclass network equilibrium problem with affine cost functions
Annals of Operations Research | 2019-03-06 | Paper |
Achieving rental harmony with a secretive roommate
The American Mathematical Monthly | 2019-02-01 | Paper |
The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Colorful linear programming, Nash equilibrium, and pivots
Discrete Applied Mathematics | 2018-04-04 | Paper |
Fair splitting of colored paths
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Fair splitting of colored paths
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Strengthening topological colorful results for graphs
European Journal of Combinatorics | 2017-06-23 | Paper |
| Aircraft routing and crew pairing: updated algorithms at Air France | 2017-06-21 | Paper |
| Analysis of an algorithm catching elephants on the Internet | 2017-02-10 | Paper |
A business dinner problem
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-10-27 | Paper |
Hedetniemi's conjecture for Kneser hypergraphs
Journal of Combinatorial Theory. Series A | 2016-08-01 | Paper |
Shared mobility systems
4OR | 2016-01-13 | Paper |
Design and operation for an electric taxi fleet
OR Spectrum | 2015-03-12 | Paper |
The uniqueness property for networks with several origin-destination pairs
European Journal of Operational Research | 2015-02-04 | Paper |
A Lemke-like algorithm for the multiclass network equilibrium problem
Web and Internet Economics | 2015-01-12 | Paper |
Colorful subhypergraphs in Kneser hypergraphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Colorful subhypergraphs in Kneser hypergraphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
A combinatorial approach to colourful simplicial depth
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
| A combinatorial approach to colourful simplicial depth | 2014-06-11 | Paper |
Envy-free two-player \(m\)-cake and three-player two-cake divisions
Operations Research Letters | 2014-05-15 | Paper |
Bike sharing systems: solving the static rebalancing problem
Discrete Optimization | 2014-04-15 | Paper |
Simplotopal maps and necklace splitting
Discrete Mathematics | 2014-03-07 | Paper |
Computing and proving with pivots
RAIRO - Operations Research | 2014-02-24 | Paper |
A further generalization of the colourful Carathéodory theorem
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Polytopal complexes: maps, chain complexes and \(\ldots\) necklaces
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
LAD models, trees, and an analog of the fundamental theorem of arithmetic
Discrete Applied Mathematics | 2013-04-25 | Paper |
Computing solutions of the paintshop-necklace problem
Computers & Operations Research | 2012-11-15 | Paper |
Balancing the stations of a self service ``bike hire system
RAIRO - Operations Research | 2011-07-14 | Paper |
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
4OR | 2011-06-30 | Paper |
The chromatic number of almost stable Kneser hypergraphs
Journal of Combinatorial Theory. Series A | 2011-06-17 | Paper |
Discrete splittings of the necklace
Mathematics of Operations Research | 2011-04-27 | Paper |
Optimal linear estimator of origin-destination flows with redundant data
Annals of Operations Research | 2011-04-08 | Paper |
Completely symmetric configurations for \(\sigma \)-games on grid graphs
Journal of Algebraic Combinatorics | 2010-06-16 | Paper |
Carathéodory, Helly and the others in the max-plus world
Discrete & Computational Geometry | 2010-04-12 | Paper |
Greedy colorings for the binary paintshop problem
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Paintshop, odd cycles and necklace splitting
Discrete Applied Mathematics | 2009-06-30 | Paper |
A combinatorial proof of a theorem of Freund
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
Combinatorial Stokes formulae
European Journal of Combinatorics | 2007-11-30 | Paper |
Sperner labellings: A combinatorial approach
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
A topological lower bound for the circular chromatic number of Schrijver graphs
Journal of Graph Theory | 2005-08-29 | Paper |
Box complexes: at the crossroad of graph theory and topology
(available as arXiv preprint) | N/A | Paper |
Quasi-kernels in split graphs
(available as arXiv preprint) | N/A | Paper |
