Conferences in DBLP
Christos H. Papadimitriou Decision-Making with Incomplete Information. [Citation Graph (0, 0)][DBLP ] Conf ] D. T. Lee , Majid Sarrafzadeh Maximum Independent Set of a Permutation Graph in k Tracks. [Citation Graph (0, 0)][DBLP ] Conf ] Yaw-Ling Lin , Steven Skiena Algorithms for Square Roots of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Fujita , Masafumi Yamashita , Tadashi Ae Distributed k-Mutual Exclusion Problem and k-Coteries. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Raghunathan , Huzur Saran Is the Shuffle-Exchange Better Than the Butterfly? [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Weighted Random Assignments with Application to Hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Shin-Ichi Nakano , Takao Nishizeki Scheduling File Transfers under Port and Channel Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Wen-Lian Hsu , Tze-Heng Ma Substitution Decomposition on Chordal Graphs and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Atsushi Takahashi , Shuichi Ueno , Yoji Kajitani Mixed-Searching and Proper-Path-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Wagner , Barbara Wolfers Short Wire Routing in Convex Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner A New Approach to Knock-Knee Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Takeshi Tokuyama Circuit Partitioning Algorithms: Graph Model versus Geometry Model. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Peter L. Hammer , Toshihide Ibaraki , Kazuhiko Kawakami Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. [Citation Graph (0, 0)][DBLP ] Conf ] T. H. Hu , Chuan Yi Tang , Richard C. T. Lee An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Kwong-fai Chan , Tak Wah Lam An On-Line Algorithm for Navigating in Unknown Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Janardan On Maintaining the Width and Diameter of a Planar Point-Set Online. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner Optimal Triangulations by Retriangulating. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , John Hershberger , Joseph S. B. Mitchell , Jack Snoeyink Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan , Tomio Hirata , Yasuyoshi Inagaki An Incremental Algorithm for Constructing Shortest Watchman Routes. [Citation Graph (0, 0)][DBLP ] Conf ] H. S. Lee , Ruei-Chuan Chang On Hitting Grid Points in a Convex Polygon with Straight Lines. [Citation Graph (0, 0)][DBLP ] Conf ] A. Benkouar , Yannis Manoussakis , Vangelis Th. Paschos , Rachid Saad On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Szpankowski Combinatorial Optimization Through Order Statistics. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas Combinatorics and Algorithms of Geometric Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Susumu Hasegawa , Hiroshi Imai , Koji Hakata An Analysis of Randomized Shear Sort on the Mesh Computer. [Citation Graph (0, 0)][DBLP ] Conf ] I-Chen Wu Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies. [Citation Graph (0, 0)][DBLP ] Conf ] Mee Yee Chan , Francis Y. L. Chin , Chung Keung Poon Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. [Citation Graph (0, 0)][DBLP ] Conf ] Alistair Moffat , Ola Petersson Historical Searching and Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Tony W. Lai Comparison-Efficient And Write-Optimal Searching and Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] F. Frances Yao Nearest Neighbors Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Estivill-Castro , Murray Sherk Competitiveness and Response Time in On-Line Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jan-Ming Ho A Linear Time Optimal Via Assignment Algorithm for Three-Dimensional Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Longpré , Sarah Mocas Symmetry of Information and One-Way Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Lih-Hsing Hsu , Jeng-Yan Hwang , Tung-Yang Ho , Chang-Hsiung Tsai A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Vijaya Ramachandran On Finding a Smallest Augmentation to Biconnect a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaufmann , Gerhard Klär A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Peter Lenhof , Michiel H. M. Smid An Optimal Construction Method for Generalized Convex Layers. [Citation Graph (0, 0)][DBLP ] Conf ] Michiel H. M. Smid Rectangular Point Location and the Dynamic Closest Pair Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ip-Wang Chan , Donald K. Friesen Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Diks , Oscar Garrido , Andrzej Lingas Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] 