Binhai Zhu

Proceedings of the String Processing and Information Retrieval, 2023

On Sorting by Flanked Transpositions.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

A Convolutional Denoising Autoencoder for Protein Scaffold Filling.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

On Computing a Center Persistence Diagram.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Guarding Precise and Imprecise Polyhedral Terrains with Segments.

[BibT_eX]

[DOI]

Bradley McCoy

Aakash Dutt

Proceedings of the Combinatorial Optimization and Applications, 2023

The Longest Subsequence-Repeated Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Computing the Tandem Duplication Distance is NP-Hard.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Computing a consensus trajectory in a vehicular network.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 19th International Conference, 2022

Deep Learning Approaches for the Protein Scaffold Filling Problem.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

Beyond the Longest Letter-Duplicated Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the solution bound of two-sided scaffold filling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Dispersing and grouping points on planar segments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Optimal Grain Mixing is NP-Complete.

[BibT_eX]

[DOI]

CoRR, 2021

Beyond the Longest Letter-duplicated Subsequence Problem.

[BibT_eX]

[DOI]

CoRR, 2021

On Comparing the Similarity and Dissimilarity Between Two Distinct Vehicular Trajectories.

[BibT_eX]

[DOI]

IEEE Access, 2021

Permutation-Constrained Common String Partitions with Applications.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

2020

Approaching the One-Sided Exemplar Adjacency Number Problem.

[BibT_eX]

[DOI]

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

Computational Geometry Column 70: Processing Persistence Diagrams as Purely Geometric Objects.

[BibT_eX]

[DOI]

SIGACT News, 2020

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Breakpoint distance and PQ-trees.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Dispersing and Grouping Points on Segments in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

The Tandem Duplication Distance Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Tandem Duplications, Segmental Duplications and Deletions, and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2020

Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

The discrete and mixed minimax 2-center problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On some matching problems under the color-spanning model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Efficient algorithms for computing one or two discrete centers hitting a set of line segments.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, Systems, and Applications, 2019

Trajectory Comparison in a Vehicular Network II: Eliminating the Redundancy.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, Systems, and Applications, 2019

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Finding disjoint dense clubs in a social network.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A 2k-kernelization algorithm for vertex cover based on crown decomposition.

[BibT_eX]

[DOI]

Wenjun Li

Theor. Comput. Sci., 2018

Solving the maximum internal spanning tree problem on interval graphs in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The connected disk covering problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

A 2-approximation algorithm for the contig-based genomic scaffold filling problem.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2018

Approximate Nearest Neighbors in the Space of Persistence Diagrams.

[BibT_eX]

[DOI]

CoRR, 2018

On Approaching the One-Sided Exemplar Adjacency Number Problem.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 14th International Symposium, 2018

A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Hitting a Set of Line Segments with One or Two Discrete Centers.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

On the Minimum Copy Number Generation Problem in Cancer Genomics.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017

Improved algorithms for intermediate dataset storage in a cloud-based dataflow.

[BibT_eX]

[DOI]

Jie Cheng

Theor. Comput. Sci., 2017

OpinionWalk: An efficient solution to massive trust assessment in online social networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling.

[BibT_eX]

[DOI]

Algorithmica, 2016

An Architecture of Cloud-Assisted Information Dissemination in Vehicular Networks.

[BibT_eX]

[DOI]

Qing Yang

Shaoen Wu

IEEE Access, 2016

On the General Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Filling a Protein Scaffold with a Reference.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

Finding Disjoint Dense Clubs in an Undirected Graph.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling: A Progress Report.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling Revisited.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

A Polynomial Time Solution for Permutation Scaffold Filling.

[BibT_eX]

[DOI]

Nan Liu

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Improved parameterized and exact algorithms for cut problems on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Robust optimization for the hazardous materials transportation network design problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Complexity analysis and algorithms for the Program Download Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Expected computations on color spanning sets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

An incremental version of the k-center problem on boundary of a convex polygon.

[BibT_eX]

[DOI]

Hai Du

J. Comb. Optim., 2015

Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input.

[BibT_eX]

[DOI]

CoRR, 2015

Isomorphism and similarity for 2-generation pedigrees.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

Computing an Optimal Path with the Minimum Number of Distinct Sensors.

[BibT_eX]

[DOI]

Qing Yang

Proceedings of the Wireless Algorithms, Systems, and Applications, 2015

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow.

[BibT_eX]

[DOI]

Jie Cheng

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

The Discrete and Mixed Minimax 2-Center Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Following a curve with the discrete Fréchet distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Combinatorial Optimization and Applications.

[BibT_eX]

[DOI]

Peter Widmayer

Theor. Comput. Sci., 2014

Voronoi diagram with visual restriction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On Some Proximity Problems of Colored Sets.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2014

A linear kernel for the complementary maximal strip recovery problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Radiation hybrid map construction problem parameterized.

[BibT_eX]

[DOI]

Chihao Zhang

J. Comb. Optim., 2014

Weak visibility polygons of NURBS curves inside simple polygons.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2014

A note on visibility-constrained Voronoi diagrams.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Intermittent Map Matching with the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

CoRR, 2014

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

CoRR, 2014

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Algorithms for Cut Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

On the Exact Block Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Streaming with minimum space: An algorithm for covering by two congruent balls.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Protein Chain Pair Simplification under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

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

An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.

[BibT_eX]

[DOI]

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

Largest area convex hull of imprecise data based on axis-aligned squares.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

On some geometric problems of color-spanning sets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Baseline Bounded half-Plane Voronoi Diagram.

[BibT_eX]

[DOI]

Bing Su

Discret. Math. Algorithms Appl., 2013

The Radiation Hybrid Map Construction Problem Is FPT.

[BibT_eX]

[DOI]

Iyad A. Kanj

Ge Xia

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Tight Approximation Bounds for Connectivity with a Color-Spanning Set.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Extending the lifetime of a WSN by partial covers.

[BibT_eX]

[DOI]

Brendan Mumey

Kelly Spendlove

Proceedings of IEEE International Conference on Communications, 2013

The Program Download Problem: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Expected Computations on Color Spanning Sets.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

A Retrospective on Genomic Preprocessing for Comparative Genomics.

[BibT_eX]

[DOI]

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

A (1+ε)-approximation algorithm for sorting by short block-moves.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Scaffold Filling under the Breakpoint and Related Distances.

[BibT_eX]

[DOI]

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

Minimum common string partition revisited.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Exact and approximation algorithms for the complementary maximal strip recovery problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Comparing Pedigree Graphs.

[BibT_eX]

[DOI]

J. Comput. Biol., 2012

A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem.

[BibT_eX]

[DOI]

Bin Fu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

On the red/blue spanning tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Continuous-Time Moving Network Voronoi Diagram.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2011

Algorithms for sorting unsigned linear genomes by the DCJ operations.

[BibT_eX]

[DOI]

Bioinform., 2011

A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Wakeup Scheduling in Roadside Directional Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies.

[BibT_eX]

[DOI]

Farong Zhong

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data.

[BibT_eX]

[DOI]

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

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

Minimum Interval Cover and Its Application to Genome Sequencing.

[BibT_eX]

[DOI]

Liang Ding

Bin Fu

Proceedings of the Combinatorial Optimization and Applications, 2011

On Some Geometric Problems of Color-Spanning Sets.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

On the Tractability of Maximal Strip Recovery.

[BibT_eX]

[DOI]

Lusheng Wang

J. Comput. Biol., 2010

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.

[BibT_eX]

[DOI]

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

Weak Kernels.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Algorithms for Comparing Pedigree Graphs

[BibT_eX]

[DOI]

CoRR, 2010

Guarding a Terrain by Two Watchtowers.

[BibT_eX]

[DOI]

Algorithmica, 2010

Scaffold Filling under the Breakpoint Distance.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - International Workshop, 2010

Moving Network Voronoi Diagram.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Breakpoint Distance and PQ-Trees.

[BibT_eX]

[DOI]

Cédric Chauve

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Fréchet-Distance on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

A Linear Kernel for Co-Path/Cycle Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

The canadian traveller problem and its competitive analysis.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

On recovering syntenic blocks from comparative maps.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Efficient Algorithms for the Closest String and Distinguishing String Selection Problems.

[BibT_eX]

[DOI]

Lusheng Wang

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

On the Approximability of Some Haplotyping Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Preface.

[BibT_eX]

[DOI]

Andreas W. M. Dress

J. Comb. Optim., 2008

On the inapproximability of the exemplar conserved interval distance problem of genomes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.

[BibT_eX]

[DOI]

J. Comput. Biol., 2008

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

[BibT_eX]

[DOI]

Ying Xu

J. Bioinform. Comput. Biol., 2008

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

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Automatically Approximating 3D Points with Co-Axisal Objects.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

2007

Editorial, special issue on bioinformatics.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

RNA multiple structural alignment with longest common subsequences.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Protein Local Structure Alignment Under the Discrete Fréchet Distance.

[BibT_eX]

[DOI]

J. Comput. Biol., 2007

On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance

[BibT_eX]

[DOI]

CoRR, 2007

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance

[BibT_eX]

[DOI]

Sergey Bereg

Marina L. Gavrilova

CoRR, 2007

Non-breaking Similarity of Genomes with Gene Repetitions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Volume Computation Using a Direct Monte Carlo Method.

[BibT_eX]

[DOI]

Sheng Liu

Jian Zhang

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

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

[BibT_eX]

[DOI]

Ying Xu

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Preface.

[BibT_eX]

[DOI]

Nimrod Megiddo

Theor. Comput. Sci., 2006

On the edge linfinitf radius of Saitou and Nei's method for phylogenetic reconstruction.

[BibT_eX]

[DOI]

Wenqiang Dai

Theor. Comput. Sci., 2006

On a Minimum Linear Classification Problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2006

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

A PTAS for a disc covering problem using width-bounded separators.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Voronoi Diagram and Delaunay Triangulation: Applications and Challenges in Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

The Approximability of the Exemplar Breakpoint Distance Problem.

[BibT_eX]

[DOI]

Bin Fu

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

A lower bound on the edge linfinitely radius of Saitou and Nei's method for phylogenetic reconstruction.

[BibT_eX]

[DOI]

Wenqiang Dai

Inf. Process. Lett., 2005

Guarding a terrain by two watchtowers.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

RNA Multiple Structural Alignment with Longest Common Subsequences.

[BibT_eX]

[DOI]

Sergey Bereg

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Preface.

[BibT_eX]

[DOI]

Tandy J. Warnow

Theor. Comput. Sci., 2004

Approximating 3D Points With Cylindrical Segments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2004

Guest editor's foreword.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2004

Contour interpolation with bounded dihedral angles.

[BibT_eX]

[DOI]

Sergey Bereg

Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

New Bounds on Map Labeling with Circular Labels.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Cylindrical Approximation of a Neuron from Reconstructed Polyhedron.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2004

Approximations for Two Decomposition-Based Geometric Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2004

A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Polynomial time algorithms for three-label point labeling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On a Minimum Linear Classification Problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2003

A simple factor-3 approximation for labeling points with circles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Some Problems on Factorizations with Constraints in Bipartite Graphs.

[BibT_eX]

[DOI]

Guizhen Liu

Discret. Appl. Math., 2003

On Lawson's Oriented Walk in Random Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

WebSail: From On-line Learning to Web Search.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2002

New Approximation Algorithms for Map Labeling with Sliding Labels.

[BibT_eX]

[DOI]

Zhongping Qin

J. Comb. Optim., 2002

Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm.

[BibT_eX]

[DOI]

Inf. Retr., 2002

On Connected [k, k+1]-Factors in Claw-Free Graphs.

[BibT_eX]

Guojun Li

Chuanping Chen

Ars Comb., 2002

A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.

[BibT_eX]

[DOI]

Zhongping Qin

Proceedings of the Algorithm Theory, 2002

2001

FEATURES: Real-time adaptive feature and document learning for web search.

[BibT_eX]

[DOI]

J. Assoc. Inf. Sci. Technol., 2001

Efficient Approximation Algorithms for Two-Label Point Labeling.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Polynomial Time Algorithms for Three-Label Point Labeling.

[BibT_eX]

[DOI]

Rob Duncan

Jianbo Qian

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

On the Planar Two-Watchtower Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Three-dimensional weak visibility: Complexity and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

On Some Polyhedra Covering Problems.

[BibT_eX]

[DOI]

Bo-Ting Yang

J. Comb. Optim., 2000

Fast Range Searching with Delaunay Triangulations.

[BibT_eX]

[DOI]

GeoInformatica, 2000

Computing the Degree-4 Shortest Network under a Given Topology.

[BibT_eX]

[DOI]

Jichang Ye

Discret. Comput. Geom., 2000

Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

New Algorithms for Two-Label Point Labeling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

On Some Optimization Problems in Obnoxious Facility Location.

[BibT_eX]

[DOI]

Zhongping Qin

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Computing the Optimal Bridge Between Two Convex Polygons.

[BibT_eX]

[DOI]

Leizhen Cai

Inf. Process. Lett., 1999

Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.

[BibT_eX]

[DOI]

Ernst P. Mücke

Isaac Saias

Comput. Geom., 1999

A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.

[BibT_eX]

[DOI]

Xiaotie Deng

Algorithmica, 1999

Efficient Approximation Algorithms for Multi-label Map Labeling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

A simple probablistic algorithm for approximating two and three-dimensional objects.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.

[BibT_eX]

[DOI]

David Avis

Bryan Beresford-Smith

SIAM J. Comput., 1998

A Polynomial Time Solution for Labeling a Rectlinear Map.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Inf. Process. Lett., 1998

A Note on Point Location in Delaunay Triangulations of Random Points.

[BibT_eX]

[DOI]

Luc Devroye

Ernst P. Mücke

Algorithmica, 1998

On Computing and Drawing Maxmin-Height Covering Triangulation.

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

Approximating Convex Polyhedra with Axis-Parallel Boxes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Guarding Polyhedral Terrains.

[BibT_eX]

[DOI]

Prosenjit Bose

Thomas C. Shermer

Comput. Geom., 1997

Feasibility of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Algorithmica, 1997

Map Labeling and Its Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

A Polynomial Time Solution for Labeling a Rectilinear Map.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Shooter location problems revisited.

[BibT_eX]

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

On the Sectional Area of Convex Polytopes.

[BibT_eX]

[DOI]

David Avis

Prosenjit Bose

Thomas C. Shermer

Jack Snoeyink

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Two-Guarding a Rectilinear Polygon.

[BibT_eX]

[DOI]

Xuehou Tan

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

On the omega(n4/3) Weak Lower Bounds for Some 3D Geometric Problems.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994

Intersections of random line segments.

[BibT_eX]

[DOI]

Luc Devroye

Int. J. Comput. Geom. Appl., 1994

Further Computational Geometry in Secondary Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Intersection Detection and Computation of Manhattan Terrains.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Feasability of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.

[BibT_eX]

Clark Verbrugge

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Computing the Shortest Diagonal of a Monotone Polygon in Linear Time.

[BibT_eX]

[DOI]