| An O(n(2))-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position | 0 | 0.34 | 2022 |
| Max-Min 3-Dispersion Problems | 0 | 0.34 | 2021 |
| The Coverage Problem by Aligned Disks | 0 | 0.34 | 2021 |
| Efficient Algorithms For The Partial Sum Dispersion Problem | 0 | 0.34 | 2020 |
| An Approximation Algorithm For The 2-Dispersion Problem | 0 | 0.34 | 2020 |
| Enumerating Highly-Edge-Connected Spanning Subgraphs | 0 | 0.34 | 2019 |
| Enumerating Floorplans With Columns | 0 | 0.34 | 2018 |
| Exact Algorithms for the Max-Min Dispersion Problem. | 0 | 0.34 | 2018 |
| A Simple Algorithm For R-Gatherings On The Line | 0 | 0.34 | 2018 |
| Enumeration, Counting, And Random Generation Of Ladder Lotteries | 0 | 0.34 | 2017 |
| Another Optimal Binary Representation Of Mosaic Floorplans | 0 | 0.34 | 2015 |
| Enumeration, Counting, and Random Generation of Ladder Lotteries. | 0 | 0.34 | 2015 |
| A Compact Encoding Of Rectangular Drawings With Edge Lengths | 0 | 0.34 | 2013 |
| Bounding the number of reduced trees, cographs, and series-parallel graphs by compression | 0 | 0.34 | 2012 |
| Enumerating All Rooted Trees Including K Leaves | 0 | 0.34 | 2012 |
| Efficient enumeration of ordered trees with k leaves | 0 | 0.34 | 2012 |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2 | 0.39 | 2012 |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 4 | 0.51 | 2012 |
| A compact encoding of unordered binary trees | 0 | 0.34 | 2011 |
| Listing All St-Orientations | 1 | 0.36 | 2011 |
| Efficient enumeration of all ladder lotteries and its application | 4 | 0.56 | 2010 |
| A compact encoding of plane triangulations with efficient query supports | 6 | 0.49 | 2010 |
| A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. | 8 | 0.53 | 2009 |
| A Simple Canonical Code For Fullerene Graphs | 0 | 0.34 | 2009 |
| Efficient algorithms for airline problem | 0 | 0.34 | 2007 |
| A Compact Encoding of Rectangular Drawings with Efficient Query Supports | 3 | 0.45 | 2007 |
| Constant Time Generation of Integer Partitions | 5 | 0.64 | 2007 |
| Constant Time Generation of Rectangular Drawings with Exactly n Faces | 0 | 0.34 | 2006 |
| Coding Floorplans with Fewer Bits | 4 | 0.51 | 2006 |
| Convex Grid Drawings Of Four-Connected Plane Graphs | 8 | 0.68 | 2006 |
| Generating Colored Trees | 9 | 0.69 | 2005 |
| Constant Time Generation of Set Partitions | 9 | 0.62 | 2005 |
| Generating All Series-Parallel Graphs | 0 | 0.34 | 2005 |
| Efficient Generation of Triconnected Plane Triangulations | 12 | 0.88 | 2004 |
| Constant time generation of trees with specified diameter | 29 | 1.57 | 2004 |
| Discovering Frequent Substructures in Large Unordered Trees | 93 | 4.86 | 2003 |
| Labeling Points With Rectangles Of Various Shapes | 1 | 0.36 | 2002 |
| Grid Drawings of 4-Connected Plane Graphs | 27 | 1.61 | 2001 |
| Box-Rectangular Drawings of Plane Graphs | 11 | 0.79 | 2000 |
| Rectangular drawings of plane graphs without designated corners | 10 | 0.80 | 2000 |
