| Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams | 0 | 0.34 | 2022 |
| Reforming an Envy-Free Matching. | 0 | 0.34 | 2022 |
| Clustersets: Optimizing Planar Clusters In Categorical Point Data | 0 | 0.34 | 2021 |
| Algorithms For Gerrymandering Over Graphs | 0 | 0.34 | 2021 |
| Algorithmic Enumeration Of Surrounding Polygons | 0 | 0.34 | 2021 |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 0 | 0.34 | 2021 |
| Subgraph Isomorphism On Graph Classes That Exclude A Substructure | 0 | 0.34 | 2020 |
| Linear-Time Recognition of Double-Threshold Graphs | 0 | 0.34 | 2020 |
| Reconfiguration of Maximum-Weight b-Matchings in a Graph. | 0 | 0.34 | 2019 |
| Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. | 0 | 0.34 | 2019 |
| Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. | 0 | 0.34 | 2018 |
| Exact Algorithms for the Max-Min Dispersion Problem. | 0 | 0.34 | 2018 |
| Orthogonal And Smooth Orthogonal Layouts Of 1-Planar Graphs With Low Edge Complexity | 1 | 0.34 | 2018 |
| Efficient stabilization of cooperative matching games | 1 | 0.35 | 2017 |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. | 0 | 0.34 | 2017 |
| Sequentially Swapping Colored Tokens On Graphs | 2 | 0.37 | 2017 |
| Balanced Line Separators of Unit Disk Graphs. | 0 | 0.34 | 2017 |
| Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). | 0 | 0.34 | 2017 |
| On the treewidth of toroidal grids | 0 | 0.34 | 2016 |
| Tight Exact and Approximate Algorithmic Results on Token Swapping. | 0 | 0.34 | 2016 |
| Approximation and Hardness of Token Swapping. | 1 | 0.36 | 2016 |
| Computing the $L_1$ Geodesic Diameter and Center of a Polygonal Domain | 1 | 0.38 | 2015 |
| Computing the L1 geodesic diameter and center of a simple polygon in linear time. | 0 | 0.34 | 2015 |
| Swapping Labeled Tokens on Graphs. | 3 | 0.47 | 2014 |
| Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set | 0 | 0.34 | 2014 |
| Computing the L 1 geodesic diameter and center of a simple polygon in linear time | 6 | 0.49 | 2014 |
| Weight Balancing on Boundaries and Skeletons | 0 | 0.34 | 2014 |
| Extended Formulations for Sparsity Matroids. | 0 | 0.34 | 2014 |
| Computing the Geodesic Centers of a Polygonal Domain. | 3 | 0.42 | 2014 |
| Minimum-Cost b -Edge Dominating Sets on Trees. | 0 | 0.34 | 2014 |
| Guest Editorial: Selected Papers from ISAAC 2011. | 0 | 0.34 | 2013 |
| Computational Complexity And An Integer Programming Model Of Shakashaka | 2 | 0.39 | 2013 |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms. | 5 | 0.44 | 2013 |
| Exact and fixed-parameter algorithms for metro-line crossing minimization problems. | 2 | 0.38 | 2013 |
| The complexity of the stamp folding problem | 1 | 0.43 | 2013 |
| Querying two boundary points for shortest paths in a polygonal domain | 3 | 0.38 | 2012 |
| Vertex angle and crossing angle resolution of leveled tree drawings | 3 | 0.45 | 2012 |
| Area Bounds of Rectilinear Polygons Realized by Angle Sequences. | 0 | 0.34 | 2012 |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2 | 0.39 | 2012 |
| On bipartite powers of bigraphs. | 1 | 0.38 | 2012 |
| Efficient enumeration of the directed binary perfect phylogenies from incomplete data | 1 | 0.36 | 2012 |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 4 | 0.51 | 2012 |
| A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization | 1 | 0.37 | 2011 |
| The t-Pebbling Number is Eventually Linear in t. | 0 | 0.34 | 2011 |
| Dominating set counting in graph classes | 3 | 0.42 | 2011 |
| Hardness results and an exact exponential algorithm for the spanning tree congestion problem | 1 | 0.35 | 2011 |
| Minimum and maximum against k lies | 0 | 0.34 | 2010 |
| Improved Bounds for Wireless Localization | 8 | 0.90 | 2010 |
| The geodesic diameter of polygonal domains | 5 | 0.51 | 2010 |
| On listing, sampling, and counting the chordal graphs with edge constraints | 3 | 0.41 | 2010 |
