| Vessel velocity decisions in inland waterway transportation under uncertainty | 0 | 0.34 | 2022 |
| The Kaleidoscopic Game of Life | 0 | 0.34 | 2022 |
| Inland waterway efficiency through skipper collaboration and joint speed optimization | 0 | 0.34 | 2021 |
| Cyclic Lot-Sizing Problems With Sequencing Costs | 0 | 0.34 | 2021 |
| Dispersing Obnoxious Facilities On A Graph | 0 | 0.34 | 2021 |
| On The Status Sequences Of Trees | 0 | 0.34 | 2021 |
| Printed Circuit Boards Isomorphism: An Experimental Study | 0 | 0.34 | 2020 |
| Inland Waterway Efficiency Through Skipper Collaboration and Joint Speed Optimization. | 0 | 0.34 | 2019 |
| Location, Pricing and the Problem of Apollonius. | 2 | 0.38 | 2017 |
| An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. | 0 | 0.34 | 2017 |
| A PTAS for the Cluster Editing Problem on Planar Graphs. | 0 | 0.34 | 2016 |
| A Note On The Minimum H-Subgraph Edge Deletion | 0 | 0.34 | 2015 |
| On Low Treewidth Graphs and Supertrees. | 1 | 0.37 | 2015 |
| On Time-Optimal Trajectories in Non-Uniform Mediums | 0 | 0.34 | 2015 |
| Complexity and approximability of the k-way vertex cut. | 1 | 0.36 | 2014 |
| Scheduling unit-length jobs with precedence constraints of small height | 0 | 0.34 | 2014 |
| Bidimensionality of Geometric Intersection Graphs. | 1 | 0.35 | 2013 |
| Dynamic pricing problems with elastic demand. | 1 | 0.35 | 2012 |
| How to cut a graph into many pieces | 2 | 0.43 | 2011 |
| A note on the integrality gap of an ILP formulation for the periodic maintenance problem | 0 | 0.34 | 2011 |
| Price strategy implementation | 0 | 0.34 | 2011 |
| On the complexity of a bundle pricing problem. | 0 | 0.34 | 2011 |
| Tree-width and large grid minors in planar graphs | 1 | 0.36 | 2011 |
| Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph | 0 | 0.34 | 2010 |
| On the Complexity of the Highway Pricing Problem | 2 | 0.41 | 2010 |
| Scheduling jobs with time-resource tradeoff via nonlinear programming | 7 | 0.63 | 2009 |
| Connected Feedback Vertex Set in Planar Graphs | 7 | 0.62 | 2009 |
| On planar graphs with large tree-width and small grid minors | 2 | 0.37 | 2009 |
| The valve location problem: Minimizing environmental damage of a spill in long oil pipelines | 0 | 0.34 | 2009 |
| On the minimum corridor connection problem and other generalized geometric problems | 13 | 0.72 | 2009 |
| Optimal pricing of capacitated networks | 6 | 0.66 | 2009 |
| Algorithms for Optimal Price Regulations | 0 | 0.34 | 2008 |
| Optimal bundle pricing with monotonicity constraint | 5 | 0.48 | 2008 |
| Treewidth Lower Bounds with Brambles | 19 | 0.78 | 2008 |
| Algorithms for Graphs Embeddable with Few Crossings per Edge | 21 | 0.86 | 2007 |
| The valve location problem | 0 | 0.34 | 2007 |
| Bundle pricing with comparable items | 8 | 0.59 | 2007 |
| Optimal bundle pricing for homogeneous items | 0 | 0.34 | 2007 |
| The geometric generalized minimum spanning tree problem with grid clustering. | 3 | 0.40 | 2006 |
| Modeling and solving the periodic maintenance problem | 30 | 1.79 | 2006 |
| How to sell a graph: guidelines for graph retailers | 18 | 1.02 | 2006 |
| On the high multiplicity traveling salesman problem | 6 | 0.49 | 2006 |
| LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times | 3 | 0.43 | 2006 |
| A Framework for the Complexity of High-Multiplicity Scheduling Problems | 20 | 1.47 | 2005 |
| Scheduling parallel jobs with linear speedup | 5 | 0.50 | 2005 |
| Unrelated parallel machine scheduling with resource dependent processing times | 9 | 1.31 | 2005 |
| Pricing network edges to cross a river | 10 | 1.01 | 2004 |
