Minghui Jiang

CoRR, 2021

Decomposing a graph into subgraphs with small components.

[BibT_eX]

[DOI]

CoRR, 2021

Vertebrate interval graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Partitioning an interval graph into subgraphs with small claws.

[BibT_eX]

[DOI]

CoRR, 2021

Caterpillars and alternating paths.

[BibT_eX]

[DOI]

CoRR, 2021

Disjoint axis-parallel segments without a circumscribing polygon.

[BibT_eX]

[DOI]

CoRR, 2021

Linking disjoint axis-parallel segments into a simple polygon is hard too.

[BibT_eX]

[DOI]

CoRR, 2021

Moving intervals for packing and covering.

[BibT_eX]

[DOI]

CoRR, 2021

Linking disjoint segments into a simple polygon is hard.

[BibT_eX]

[DOI]

CoRR, 2021

On universal covers for carpenter's rule folding.

[BibT_eX]

[DOI]

CoRR, 2021

2019

Computational Geometry Column 69.

[BibT_eX]

[DOI]

SIGACT News, 2019

2018

Periodicity of identifying codes in strips.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

On the Number of Maximum Empty Boxes Amidst n Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Minimum rectilinear Steiner tree of n points in the unit square.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Trees, Paths, Stars, Caterpillars and Spiders.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Perfect domination and small cycles.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2017

2016

Edge-disjoint packing of stars and cycles.

[BibT_eX]

[DOI]

Ge Xia

Theor. Comput. Sci., 2016

Shortest color-spanning intervals.

[BibT_eX]

[DOI]

Haitao Wang

Theor. Comput. Sci., 2016

Kernelization of edge perfect code and its variants.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Perfect vector sets, properly overlapping partitions, and largest empty box.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Quell.

[BibT_eX]

[DOI]

Haitao Wang

Theor. Comput. Sci., 2015

Competitive algorithms for unbounded one-way trading.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Computing Opaque Interior Barriers à la Shermer.

[BibT_eX]

[DOI]

Csaba D. Tóth

SIAM J. Discret. Math., 2015

Systems of distant representatives in Euclidean space.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

On Covering Points with Minimum Turns.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

On the approximability of covering points by lines and related problems.

[BibT_eX]

[DOI]

Comput. Geom., 2015

2014

Computational Geometry Column 60.

[BibT_eX]

[DOI]

SIGACT News, 2014

Opaque Sets.

[BibT_eX]

[DOI]

János Pach

Algorithmica, 2014

The Opaque Square.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Competitive Algorithms for Unbounded One-Way Trading.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Inapproximability of (1, 2)-Exemplar Distance.

[BibT_eX]

[DOI]

Laurent Bulteau

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Computational geometry column 58.

[BibT_eX]

[DOI]

SIGACT News, 2013

Computational geometry column 56.

[BibT_eX]

[DOI]

SIGACT News, 2013

Flipping triangles and rectangles.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Maximal Empty Boxes Amidst Random Points.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

On reconfiguration of disks in the plane and related problems.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Recognizing d-Interval Graphs and d-Track Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

On the Largest Empty Axis-Parallel Box Amidst n Points.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Tractability and approximability of maximal strip recovery.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On a Dispersion Problem in Grid Labeling.

[BibT_eX]

[DOI]

Vincent Pilaud

SIAM J. Discret. Math., 2012

Dispersion in Disks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Approximability of constrained LCS.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Clique in 3-track interval graphs is APX-hard

[BibT_eX]

[DOI]

CoRR, 2012

Minimum-Perimeter Intersecting Polygons.

[BibT_eX]

[DOI]

Algorithmica, 2012

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.

[BibT_eX]

[DOI]

Guillaume Blin

Stéphane Vialette

Proceedings of the String Processing and Information Retrieval, 2012

Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Inapproximability of maximal strip recovery.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the red/blue spanning tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Computational-Geometry Approach to Digital Image Contour Extraction.

[BibT_eX]

[DOI]

Xiaojun Qi

Trans. Comput. Sci., 2011

The Zero Exemplar Distance Problem.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

New bounds on the average distance from the Fermat-Weber center of a planar convex body.

[BibT_eX]

[DOI]

Csaba D. Tóth

Discret. Optim., 2011

The Forest Hiding Problem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Sweeping an oval to a vanishing point.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Constrained k-center and movement to independence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

An inequality on the edge lengths of triangular meshes.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Piercing Translates and Homothets of a Convex Body.

[BibT_eX]

[DOI]

Algorithmica, 2011

Sweeping Points.

[BibT_eX]

[DOI]

Algorithmica, 2011

Parameterized Complexity in Multiple-Interval Graphs: Domination.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

On the parameterized complexity of some optimization problems related to multiple-interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

K-Partite RNA Secondary Structures.

[BibT_eX]

[DOI]

J. Comput. Biol., 2010

Maximum Area Independent Sets in Disk Intersection Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Monochromatic simplices of any volume.

[BibT_eX]

[DOI]

Discret. Math., 2010

Coloring translates and homothets of a convex body

[BibT_eX]

[DOI]

CoRR, 2010

On Covering Problems of Rado.

[BibT_eX]

[DOI]

Algorithmica, 2010

Dispersion in Unit Disks.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Recognizing d-Interval Graphs and d-Track Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Inapproximability of Maximal Strip Recovery: II.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

A Linear-Time Algorithm for Hamming Distance with Shifts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

On recovering syntenic blocks from comparative maps.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

On the largest empty axis-parallel box amidst n points

[BibT_eX]

[DOI]

CoRR, 2009

Spreading grid cells

[BibT_eX]

[DOI]

CoRR, 2009

RNA folding on the 3D triangular lattice.

[BibT_eX]

[DOI]

Joel Gillespie

Martin Mayne

BMC Bioinform., 2009

A PTAS for Cutting Out Polygons with Lines.

[BibT_eX]

[DOI]

Ovidiu Daescu

Algorithmica, 2009

Computational Geometry of Contour Extraction.

[BibT_eX]

[DOI]

Xiaojun Qi

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Protein Structure-structure Alignment with Discrete FrÉchet Distance.

[BibT_eX]

[DOI]

Ying Xu

J. Bioinform. Comput. Biol., 2008

On the sum of distances along a circle.

[BibT_eX]

[DOI]

Discret. Math., 2008

On a Covering Problem for Equilateral Triangles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts.

[BibT_eX]

[DOI]

BMC Bioinform., 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Engineering the Divide-and-Conquer Closest Pair Algorithm.

[BibT_eX]

[DOI]

Joel Gillespie

J. Comput. Sci. Technol., 2007

A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

On finding a large number of 3D points with a small diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Surface-Embedded Passive RF Exteroception: Kepler, Greed, and Buffon's Needle.

[BibT_eX]

[DOI]

Vladimir A. Kulyukin

Aliasgar Kutiyanawala

Proceedings of the Ubiquitous Intelligence and Computing, 4th International Conference, 2007

Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice.

[BibT_eX]

[DOI]

Martin Mayne

Joel Gillespie

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

Protein Structure-Structure Alignment with Discrete Fr'echet Distance.

[BibT_eX]

[DOI]

Ying Xu

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

A combinatorial theorem on labeling squares with points and its application.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

A new approximation algorithm for labeling points with circle pairs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Approximating minimum coloring and maximum independent set in dotted interval graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Passive Radio Frequency Exteroception in Robot Assisted Shopping for the Blind.

[BibT_eX]

[DOI]

Chaitanya Gharpure

Vladimir A. Kulyukin

Aliasgar Kutiyanawala

Proceedings of the Ubiquitous Intelligence and Computing, Third International Conference, 2006

Subsequence Packing: Complexity, Approximation, and Application.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Protein Folding on the Hexagonal Lattice in the Hp Model.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2005

UPS-k: a set partitioning problem with applications in UPS pickup-delivery system.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2004

Contour interpolation with bounded dihedral angles.

[BibT_eX]

[DOI]