selected scholarly activity
-
academic article
- Primitive Zonotopes. Discrete and Computational Geometry. 60:27-39. 2018
- Improved bounds on the diameter of lattice polytopes. Acta Mathematica Hungarica Acta Mathematica Academiae Scientiarum Hungaricae. 154:457-469. 2018
- Managing losses in exotic horse race wagering. Journal of the Operational Research Society. 69:319-325. 2018
- Bannai et al. method proves the d-step conjecture for strings. Discrete Applied Mathematics. 217:488-494. 2017
- Computational determination of the largest lattice polytope diameter. CoRR. abs/1704.01687. 2017
- A computational substantiation of the d-step approach to the number of distinct squares problem. Discrete Applied Mathematics. 212:81-87. 2016
- A primal-simplex based Tardos' algorithm. Operations Research Letters. 43:625-628. 2015
- On a lemma of Crochemore and Rytter. Journal of Discrete Algorithms. 34:18-22. 2015
- Chance constrained optimization for targeted Internet advertising. Omega. 53:90-96. 2015
- How many double squares can a string contain?. Discrete Applied Mathematics. 180:52-69. 2015
- A d-step approach to the maximum number of distinct squares and runs in strings. Discrete Applied Mathematics. 163:268-274. 2014
- A COMBINATORIAL APPROACH TO COLOURFUL SIMPLICIAL DEPTH. SIAM Journal on Discrete Mathematics. 28:306-322. 2014
- A Combinatorial Approach to Colourful Simplicial Depth.. SIAM J. Discrete Math.. 28:306-322. 2014
- Special issue: Geometry and Optimization. Computational Geometry: Theory and Applications. 46:493-493. 2013
- More bounds on the diameters of convex polytopes. Optimization Methods and Software. 28:442-450. 2013
- A computational framework for determining run-maximal strings. Journal of Discrete Algorithms. 20:43-50. 2013
- A Note on Lower Bounds for Colourful Simplicial Depth. Symmetry. 5:47-53. 2013
- On a conjecture of Erdős for multiplicities of cliques. Journal of Discrete Algorithms. 17:9-14. 2012
- Computational Lower Bounds for Colourful Simplicial Depth. CoRR. abs/1210.7621. 2012
- On the structure of run-maximal strings. Journal of Discrete Algorithms. 10:10-14. 2012
- More Colourful Simplices. Discrete and Computational Geometry. 45:272-278. 2011
- A further generalization of the colourful Carathéodory theorem. CoRR. abs/1107.3380. 2011
- On the generalized Berge sorting conjecture. Journal of Discrete Algorithms. 8:1-7. 2010
- A Continuous d-Step Conjecture for Polytopes. Discrete and Computational Geometry. 41:318-327. 2009
- Hyperplane Arrangements with Large Average Diameter. POLYHEDRAL COMPUTATION. 48:103-114. 2009
- Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. Journal of Combinatorial Optimization. 16:323-323. 2008
- Diameter and Curvature: Intriguing Analogies. Electronic Notes in Discrete Mathematics. 31:221-225. 2008
- The colourful feasibility problem. Discrete Applied Mathematics. 156:2166-2177. 2008
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. Mathematical Programming. 113:1-14. 2008
- Polytopes and arrangements: Diameter and curvature. Operations Research Letters. 36:215-222. 2008
- A counterexample to the dominating set conjecture. Optimization Letters. 1:163-169. 2007
- One of the "pleasant and delightful problems" of Claude Berge. Discrete Mathematics. 306:2299-2302. 2006
- The central path visits all the vertices of the Klee-Minty cube. Optimization Methods and Software. 21:851-865. 2006
- Colourful simplicial depth. Discrete and Computational Geometry. 35:597-615. 2006
- The isometries of the cut, metric and hypermetric cones. Journal of Algebraic Combinatorics. 23:197-203. 2006
- Solitaire lattices. Graphs and Combinatorics. 18:227-243. 2002
- On the solitaire cone and its relationship to multi-commodity flows. Mathematical Programming. 90:27-57. 2001
- A combinatorial approach to the solitaire game. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E83A:656-661. 2000
- Fullerenes and coordination polyhedra versus half-cube embeddings. Discrete Mathematics. 192:41-80. 1998
- MCMULLEN CONDITIONS AND SOME LOWER BOUNDS FOR GENERAL CONVEX POLYTOPES. Geometriae Dedicata. 52:165-173. 1994
- A counterexample to a conjecture of Laurent and Poljak
- Berge Sorting
- Imperfect demand estimation for new product production planning
- Optimization over Degree Sequences
- The complexity of the envelope of line and plane arrangements
-
conference paper
- A Computational Framework for Determining Square-maximal Strings. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012. 111-119. 2012
- Hyperplane arrangements with large average diameter: a computational approach. ARRANGEMENTS OF HYPERPLANES - SAPPORO 2009. 59-+. 2012
- A Parameterized Formulation for the Maximum Number of Runs Problem. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011. 74-82. 2011
- A d-Step Approach for Distinct Squares in Strings. Lecture Notes in Computer Science. 77-89. 2011
- Pushing the boundaries of polytopal realizability.. CCCG. 2011
- Small Octahedral Systems.. CCCG. 2011
- EPS AND ORGANIC LAW OF EDUCATION: EXPERIENCE IN INTERAGENCY COORDINATION IN ALCORCON. Gaceta Sanitaria. 116-116. 2009
- Central Path Curvature and Iteration-Complexity for Redundant Klee-Minty Cubes. ADVANCES IN APPLIED MATHEMATICS AND GLOBAL OPTIMIZATION. 223-256. 2009
- On the face lattice of the metric polytope. Lecture Notes in Computer Science. 118-128. 2002
- On the binary solitaire cone. Discrete Applied Mathematics. 3-14. 2001
- On the skeleton of the metric polytope. Lecture Notes in Computer Science. 125-136. 2001
- On Skeletons, Diameters and Volumes of Metric Polyhedra.. Combinatorics and Computer Science. 112-128. 1995
- THE RIDGE GRAPH OF THE METRIC POLYTOPE AND SOME RELATIVES. POLYTOPES: ABSTRACT, CONVEX AND COMPUTATIONAL. 359-372. 1994