Conferences in DBLP
Mikhail J. Atallah , Danny Z. Chen Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] David Bremner Incremental Convex Hull Algorithms Are Not Output Sensitive. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Otfried Schwarzkopf Separating and Shattering Long Line Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Matthew J. Katz Optimal Line Bipartitions of Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama Interval Finding and Its Application to Data Mining. [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca , Jens Lagergren On the Approximability of the Steiner Tree Problem in Phylogeny. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Keisuke Tanaka Approximation and Special Cases of Common Subtrees and Editing Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Choi , Tak Wah Lam Two-Dimensional Dynamic Dictionary Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Alvis Brazma , Esko Ukkonen , Jaak Vilo Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , János Pach Extremal Problems for Geometric Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Matthew J. Katz Computing Fair and Bottleneck Matchings in Geormetric Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Olivier Devillers , Marc J. van Kreveld , Otfried Schwarzkopf , Monique Teillaud Computing the Maximum Overlap of Two Convex Polygons Under Translations. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyoshi Hayase , Hiroshi Imai OBDDs of a Monotone Function and of Its Prime Implicants. [Citation Graph (0, 0)][DBLP ] Conf ] Maw-Shang Chang Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sheng-Lung Peng , Ming-Tat Ko , Chin-Wen Ho , Tsan-sheng Hsu , Chuan Yi Tang Graph Searching on Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Takeaki Uno An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks , Haiko Müller , C. K. Wong Vertex Ranking of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Niedermeier Recursively Divisible Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Klaus-Jörn Lange StUSPACE(log n) <= DSPACE(log²n / log log n). [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Syurei Tamura , Takao Nishizeki Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Ming-Yang Kao Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Ka Wong Chong , Tak Wah Lam Towards More Precise Parallel Biconnectivity Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis The Complexity of Probabilistic versus Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce E. Litow Bounded Length UCFG Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] D. T. Lee , C. F. Shen The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Naoki Katoh , Manabu Sugai A Study of the LMT-Skeleton. [Citation Graph (0, 0)][DBLP ] Conf ] Cao An Wang , Francis Y. L. Chin , Yin-Feng Xu A New Subgraph of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Grammati E. Pantziou , Alan Roberts , Antonios Symvonis Dynamic Tree Routing under the ``Matching with Consumption'' Model. [Citation Graph (0, 0)][DBLP ] Conf ] Michael E. Houle , Gavin Turner Dimension-Exchange Token Distribution on the Mesh and the Torus. [Citation Graph (0, 0)][DBLP ] Conf ] Jae-Ha Lee , Chan-Su Shin , Kyung-Yong Chwa Directed Hamiltonian Packing in d -Dimensional Meshes and Its Application (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Evanthia Papadopoulou k -Pairs Non-Crossing Shortest Paths in a Simple Polygon.Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas , V. Soltan Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Hayashi , Koji Nakano , Stephan Olariu Efficient List Ranking on the Reconfigurable Mesh, with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Kutylowski , Krzysztof Lorys , Brigitte Oesterdiekhoff Periodic Merging Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gordon T. Wilfong Minimum Wavelength in an All-Optical Ring Network. [Citation Graph (0, 0)][DBLP ] Conf ] Tzuoo-Hawn Yeh , Cheng-Ming Kuo , Chin-Laung Lei , Hsu-Chun Yen Competitive Analysis of On-Line Disk Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Verriet Scheduling Interval Ordered Tasks with Non-Uniform Deadlines. [Citation Graph (0, 0)][DBLP ] Conf ] Kouichi Sakurai , Yuliang Zheng Cryptographic Weaknesses in the Round Transformation Used in a Block Cipher with Provable Immunity Against Linear Cryptanalysis (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Tsuyoshi Takagi , Shozo Naito The Multi-variable Modular Polynomial and Its Applications to Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Tsan-sheng Hsu , Dian Rae Lopez Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Panagiota Fatourou , Paul G. Spirakis Scheduling Algorithms for Strict Multithreaded Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Esteban Feuerstein , Alejandro Strejilevich de Loma On Multi-threaded Paging. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Ryabko , Andrei Fionov A Fast and Efficient Homophonic Coding Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Watanabe , Osamu Yamashita An Improvement of the Digital Cash Protocol of Okamoto and Ohta. [Citation Graph (0, 0)][DBLP ] Conf ] 