Conferences in DBLP
Mark de Berg , Mark H. Overmars , Leonidas J. Guibas , Otfried Schwarzkopf , Monique Teillaud , Dan Halperin , Micha Sharir Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Paul J. Heffernan Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Katrin Dobrindt , Mariette Yvinec Remembering Conflicts in History Yields Dynamic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer , C. R. Subramanian , C. E. Veni Madhavan Coloring Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano Graphical Degree Sequence Problems with Connectivity Requirements. [Citation Graph (0, 0)][DBLP ] Conf ] Yang Dai , Hiroshi Imai , Kazuo Iwano , Naoki Katoh How to Treat Delete Requests in Semi-Online Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Håkan Jonsson , Bengt J. Nilsson Finding the Shortest Watchman Route in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan , Tomio Hirata Constructing Shortest Watchman Routes by Divide-and-Conquer. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Hoffmann , Klaus Kriegel A Graph Coloring Result and Its Consequences for Some Guarding Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Dessmark , Klaus Jansen , Andrzej Lingas The Maximum k-Dependent and f-Dependent Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jun-ya Takahashi , Hitoshi Suzuki , Takao Nishizeki Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks Treewidth of Circle Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jingsen Chen A Framework for Constructing Heap-Like Structures In-Place. [Citation Graph (0, 0)][DBLP ] Conf ] C. M. Khoong , H. W. Leong Double-Ended Binomial Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer A Simple Balanced Search Tree with O(1) Worst-Case Update Time. [Citation Graph (0, 0)][DBLP ] Conf ] Sabine R. Öhring , Sajal K. Das Mapping Dynamic Data and Algorithm Structures into Product Networks. [Citation Graph (0, 0)][DBLP ] Conf ] J. C. Cogolludo , Sanguthevar Rajasekaran Permutation Routing on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Miltos D. Grammatikakis , D. Frank Hsu , Frank K. Hwang Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Anand Srivastav , Peter Stangier On Quadratic Lattice Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Toshihiro Fujito A 2or3-Approximation of the Matroid Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Simant Dube Using Fractal Geometry for Solving Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Ruskey Simple Combinatorial Gray Codes Constructed by Reversing Sublists. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin Time Space Tradeoffs (Getting Closer to the Barrier?). [Citation Graph (0, 0)][DBLP ] Conf ] Hing Leung Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. [Citation Graph (0, 0)][DBLP ] Conf ] Yenjo Han , Lane A. Hemaspaandra , Thomas Thierauf Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Niedermeier , Peter Rossmanith On the Power of Reading and Writing Simultaneously in Parallel Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book Relativizing Complexity Classes With Random Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] Arthur L. Liestman , Dana S. Richards An Introduction to Perpetual Gossiping. [Citation Graph (0, 0)][DBLP ] Conf ] Takahiro Ikeda A Probabilistic Selection Network with Butterfly Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Fujita , Masafumi Yamashita , Tadashi Ae Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. [Citation Graph (0, 0)][DBLP ] Conf ] Sara Bitan , Shmuel Zaks Optimal Linear Broadcast Routing with Capacity Limitations. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Frank Thomson Leighton Multicommodity Flows: A Survey of Recent Research. [Citation Graph (0, 0)][DBLP ] Conf ] Xin He , Ming-Yang Kao Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Naoki Katoh Number Theory Helps Line Detection in Digital Images. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Karsten Weihe Multicommodity Flows in Even, Planar Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Heike Ripphausen-Lipa , Dorothea Wagner , Karsten Weihe Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Andy Mirzaian Robot Mapping: Foot-Prints versus Tokens. [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis Recent Developments on the Approximability of Combinatorial Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuaki Okamoto On the Relationship among Cryptographic Physical Assumptions. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel , Stephan Waack Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Seiichiro Tani , Kiyoharu Hamaguchi , Shuzo Yajima The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris J. Kavvadias , Christos H. Papadimitriou , Martha Sideri On Horn Envelopes and Hypergraph Transversals. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Lawrence L. Larmore , Nick Reingold , Jeffery Westbrook Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Esteban Feuerstein , Alberto Marchetti-Spaccamela Memory Paging for Connectivity and Path Problems in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lucas Chi Kwong Hui , Charles U. Martel Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Hisashi Koga Randomized On-line Algorithms for the Page Replication Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne E. Hambrusch , Hung-Yi Tu New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald I. Greenberg , Shih-Chuan Hung , Jau-Der Shih Parallel Algorithms for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Takeshi Tokuyama Consecutive Interval Query and Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Takeshi Tokuyama An Improved Algorithm for the Traveler's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiyuki Karuno , Hiroshi Nagamochi , Toshihide Ibaraki Vehicle Scheduling on a Tree with Release and Handling Times. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-lok Chan , Gilbert H. Young Scheduling Algorithms for a Chain-like Task System. [Citation Graph (0, 0)][DBLP ] Conf ] Gerard J. Chang , C. Pandu Rangan , Satyan R. Coorg Weighted Independent Perfect Domination on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] D. P. Wang , N. F. Huang , H. S. Chao , Richard C. T. Lee Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Andrew Lim , Ching-Ting Wu Optimal Rectilinear Steiner Tree for Extremal Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Fößmeier , Michael Kaufmann , Alexander Zelikovsky Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 