| Envy-free Division of Multi-layered Cakes | 0 | 0.34 | 2021 |
| Topological Bounds For Graph Representations Over Any Field | 0 | 0.34 | 2021 |
| Achieving Rental Harmony with a Secretive Roommate | 4 | 0.73 | 2019 |
| Preface: Linear optimization | 0 | 0.34 | 2018 |
| A Stochastic Multi-item Lot-sizing Problem with Bounded Number of Setups. | 0 | 0.34 | 2018 |
| Integer and Mixed Integer Tverberg Numbers. | 0 | 0.34 | 2018 |
| Multilabeled Versions Of Sperner'S And Fan'S Lemmas And Applications | 0 | 0.34 | 2018 |
| Envy-free divisions of a partially burnt cake. | 0 | 0.34 | 2018 |
| Shared mobility systems: an updated survey. | 1 | 0.36 | 2018 |
| The multiple vehicle balancing problem. | 1 | 0.44 | 2018 |
| Perfect graphs with polynomially computable kernels. | 0 | 0.34 | 2018 |
| Strengthening topological colorful results for graphs. | 4 | 0.45 | 2017 |
| Fair Splitting of Colored Paths. | 1 | 0.34 | 2017 |
| The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg | 1 | 0.35 | 2017 |
| Hedetniemi's conjecture for Kneser hypergraphs | 0 | 0.34 | 2016 |
| Shared mobility systems | 14 | 0.66 | 2015 |
| Simplotopal maps and necklace splitting. | 1 | 0.35 | 2014 |
| Colorful Subhypergraphs in Kneser Hypergraphs. | 6 | 0.67 | 2014 |
| The uniqueness property for networks with several origin-destination pairs. | 2 | 0.37 | 2014 |
| A combinatorial approach to colourful simplicial depth | 1 | 0.40 | 2014 |
| Computing and proving with pivots. | 1 | 0.36 | 2013 |
| A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem. | 1 | 0.36 | 2013 |
| LAD models, trees, and an analog of the fundamental theorem of arithmetic | 0 | 0.34 | 2013 |
| Envy-free two-player m -cake and three-player two-cake divisions | 1 | 0.34 | 2013 |
| Bike sharing systems: Solving the static rebalancing problem. | 75 | 3.83 | 2013 |
| Computing solutions of the paintshop-necklace problem | 1 | 0.39 | 2012 |
| Uniqueness of equilibrium on rings | 0 | 0.34 | 2012 |
| Balancing the stations of a self service "bike hire" system. | 53 | 4.01 | 2011 |
| EasyText: an operational NLG system | 4 | 0.42 | 2011 |
| The chromatic number of almost stable Kneser hypergraphs | 11 | 0.85 | 2011 |
| Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree | 1 | 0.36 | 2011 |
| A further generalization of the colourful Carathéodory theorem | 0 | 0.34 | 2011 |
| A bird's eye view on your e-mails: Kwaga mail annotator | 0 | 0.34 | 2010 |
| Equilibrium Results for Dynamic Congestion Games | 3 | 0.51 | 2010 |
| Greedy colorings for the binary paintshop problem | 4 | 0.52 | 2010 |
| Optimal linear estimator of origin-destination flows with redundant data. | 0 | 0.34 | 2010 |
| Carathéodory, Helly and the Others in the Max-Plus World | 7 | 0.75 | 2010 |
| Paintshop, odd cycles and necklace splitting | 8 | 0.71 | 2009 |
| Directed paths on a tree: coloring, multicut and kernel | 0 | 0.34 | 2009 |
| Combinatorial Stokes formulae | 3 | 0.77 | 2008 |
| A combinatorial proof of a theorem of Freund | 0 | 0.34 | 2008 |
| Polytopal complexes: maps, chain complexes and… necklaces | 1 | 0.38 | 2008 |
| Discrete Splittings of the Necklace | 5 | 0.47 | 2008 |
| Note: A combinatorial proof of a theorem of Freund | 0 | 0.34 | 2008 |
| Dynamic assignment: there is an equilibrium | 0 | 0.34 | 2008 |
| Sperner labellings: a combinatorial approach | 5 | 0.63 | 2006 |
| A topological lower bound for the circular chromatic number of Schrijver graphs | 18 | 1.34 | 2005 |
