| Improving EFX Guarantees through Rainbow Cycle Number | 0 | 0.34 | 2021 |
| A Little Charity Guarantees Almost Envy-Freeness. | 0 | 0.34 | 2020 |
| The Query Complexity of a Permutation-Based Variant of Mastermind. | 0 | 0.34 | 2019 |
| Convergence of the non-uniform directed Physarum model | 1 | 0.35 | 2019 |
| Earning and Utility Limits in Fisher Markets. | 0 | 0.34 | 2019 |
| Convergence of the non-uniform Physarum dynamics | 1 | 0.35 | 2019 |
| Approximating the Nash Social Welfare with Budget-Additive Valuations. | 2 | 0.39 | 2018 |
| Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683]. | 0 | 0.34 | 2018 |
| An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. | 0 | 0.34 | 2016 |
| Computing Equilibria in Markets with Budget-Additive Utilities. | 2 | 0.39 | 2016 |
| Towards an open online repository of P. polycephalum networks and their corresponding graph representations. | 0 | 0.34 | 2015 |
| An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. | 4 | 0.59 | 2015 |
| P. polycephalum Can Compute Shortest Paths. | 0 | 0.34 | 2015 |
| Cache-Oblivious VAT-Algorithms. | 0 | 0.34 | 2014 |
| On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets | 1 | 0.37 | 2013 |
| New Approximability Results for the Robust k-Median Problem. | 1 | 0.35 | 2013 |
| From approximate factorization to root isolation with application to cylindrical algebraic decomposition | 15 | 0.69 | 2013 |
| Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). | 1 | 0.36 | 2012 |
| Counting arbitrary subgraphs in data streams | 28 | 0.90 | 2012 |
| Physarum can compute shortest paths. | 33 | 5.11 | 2012 |
| CGTA-Awards 2011. | 0 | 0.34 | 2012 |
| Improving the price of anarchy for selfish routing via coordination mechanisms | 14 | 0.64 | 2011 |
| Guest Editorial: Selected Papers from European Symposium on Algorithms | 0 | 0.34 | 2011 |
| A general approach to the analysis of controlled perturbation algorithms | 9 | 0.74 | 2011 |
| Arrangements on Parametric Surfaces I: General Framework and Infrastructure | 11 | 0.52 | 2010 |
| Cycle bases in graphs characterization, algorithms, complexity, and applications | 11 | 0.77 | 2009 |
| Note on the paper “K-vertex guarding simple polygons ” [Computational Geometry 42 (4) (May 2009) 352--361] | 1 | 0.37 | 2009 |
| Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings | 45 | 2.49 | 2008 |
| Classroom examples of robustness problems in geometric computations | 41 | 1.91 | 2008 |
| Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem | 8 | 0.75 | 2007 |
| Sweeping and maintaining two-dimensional arrangements on surfaces: a first step | 13 | 0.69 | 2007 |
| Reliable Geometric Computing | 0 | 0.34 | 2006 |
| Reply to "backward error analysis ..." | 0 | 0.34 | 2006 |
| New bounds for the Descartes method | 24 | 1.66 | 2006 |
| Controlled perturbation for Delaunay triangulations | 0 | 0.34 | 2005 |
| 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms | 0 | 0.34 | 2004 |
| Optimal search for rationals | 20 | 1.02 | 2003 |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | 33 | 1.58 | 2003 |
| Certifying and repairing solutions to large LPs how good are LP-solvers? | 18 | 1.36 | 2003 |
| An efficient graph algorithm for dominance constraints | 23 | 1.45 | 2003 |
| External-Memory Breadth-First Search with Sublinear I/O | 58 | 2.49 | 2002 |
| Furthest Site Abstract Voronoi Diagrams | 20 | 1.10 | 2001 |
| An efficient algorithm for the configuration problem of dominance graphs | 5 | 0.49 | 2001 |
| Randomized External-Memory Algorithms For Line Segment Intersection And Other Geometric Problems | 9 | 0.56 | 2001 |
| Traveling Salesman-Based Curve Reconstruction in Polynomial Time | 11 | 0.60 | 2001 |
| A polynomial-time fragment of dominance constraints | 8 | 0.77 | 2000 |
| Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint | 17 | 0.97 | 2000 |
| A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals | 19 | 1.76 | 2000 |
| Structural filtering: a paradigm for efficient and exact geometric programs | 6 | 0.56 | 1999 |
| The Engineering of some Bipartite Matching Programs | 0 | 0.34 | 1999 |
