Hisao Tamaki

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

Voronoi Diagram with Respect to Criteria on Vision Information.

[BibT_eX]

[DOI]

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006

Angular Voronoi Diagram with Applications.

[BibT_eX]

[DOI]

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

2005

On the probability of rendezvous in graphs.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Random Struct. Algorithms, 2005

Optimal Branch-Decomposition of Planar Graphs in O(n3) Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

On Geometric Structure of Global Roundings for Graphs and Range Spaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Matching Algorithms Are Fast in Sparse Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

The Structure and Number of Global Roundings of a Graph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2000

Multicolor routing in the undirected hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Parametric Polymatroid Optimization and Its Geometric Applications.

[BibT_eX]

[DOI]

Naoki Katoh

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Spanning Trees Crossing Few Barriers.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

How to Cut Pseudoparabolas into Segments.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Latent Semantic Indexing: A Probabilistic Analysis.

[BibT_eX]

[DOI]

Santosh S. Vempala

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Convertibility among Grid Filling Curves.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

A Characterization of Planar Graphs by Pseudo-Line Arrangements.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Multi-Color Routing in the Undirected Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets.

[BibT_eX]

[DOI]

Tatsuya Akutsu

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Greedily Finding a Dense Subgraph.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of IPPS '96, 1996

1995

Motion planning for a steering-constrained robot through moderate obstacles.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

How to Cut Pseudo-Parabolas into Segments.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Routings for Involutions of a Hypercube.

[BibT_eX]

[DOI]

Alan P. Sprague

Discret. Appl. Math., 1994

On the fault tolerance of the butterfly.

[BibT_eX]

[DOI]

Anna R. Karlin

Greg Nelson

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Construction of the Mesh and the Torus Tolerating a Large Number of Faults.

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.

[BibT_eX]

[DOI]

Kazuo Iwano

Christos H. Papadimitriou

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

Motion Planning on a Graph (Extended Abstract)

[BibT_eX]

[DOI]

Madhu Sudan

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Structural robustness of the butterfly and related networks against random faults.

[BibT_eX]

[DOI]

PhD thesis, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Robust Bounded-Degree Networks with Small Diameters.

[BibT_eX]

[DOI]

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Efficient Self-Embedding of Butterfly Networks with Random Faults

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1989

Existential Continuation.

[BibT_eX]

[DOI]

New Gener. Comput., 1989

First Order Compiler: A Deterministic Logic Program Synthesis Algorithm.

[BibT_eX]

[DOI]

J. Symb. Comput., 1989

1987

Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages.

[BibT_eX]

Proceedings of the Logic Programming, 1987

1986

OLD Resolution with Tabulation.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Logic Programming, 1986

1985

A Distributed Unification Scheme for Systolic Logic Programs.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1985

1984

Semantics of a Logic Programming Language with a Reducibility Predicate.

[BibT_eX]

Proceedings of the 1984 International Symposium on Logic Programming, 1984

Unfold/Fold Transformation of Logic Programs.

[BibT_eX]

Proceedings of the Second International Logic Programming Conference, 1984

Transformational Logic Program Synthesis.

[BibT_eX]

Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983

Program Transformation Through Meta-shifting.

[BibT_eX]

[DOI]

New Gener. Comput., 1983

Enumeration of Success Patterns in Logic Programs.

[BibT_eX]

[DOI]