Conferences in DBLP
Uzi Vishkin Methods in Parallel Algorithmics and Who May Need to Know Them? [Citation Graph (0, 0)][DBLP ] Conf ] D. T. Lee Rectilinear Paths among Rectilinear Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Maw-Hwa Chen , Sing-Ling Lee Linear Time Algorithms for k-cutwidth Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Watanabe , Toshiya Mashima , Satoshi Taoka The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sachin B. Patkar , H. Narayanan Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity. [Citation Graph (0, 0)][DBLP ] Conf ] R. Z. Hwang , Richard C. T. Lee The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson Parallel and On-line Graph Coloring Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Tsuyoshi Matsumoto Competitive Analysis of the Round Robin Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Been-Chian Chien , Rong-Jaye Chen , Wei-Pang Yang Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems. [Citation Graph (0, 0)][DBLP ] Conf ] Tony W. Lau Self-Adjusting Augmented Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Teofilo F. Gonzalez , Toshio Murayama Alhorithms for a Class of Min-Cut and Max-Cut Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jan-Ming Ho , Ming-Tat Ko , Tze-Heng Ma , Ting-Yi Sung Algorithms for Rectilinear Optimal Multicast Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ton Kloks , Hans L. Bodlaender Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Shuichi Ueno , Michihiro Yamazaki Graph Spanners and Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Omer Berkman , Yossi Matias , Uzi Vishkin Randomized Range-Maxima inNearly-Constant Parallel Time. [Citation Graph (0, 0)][DBLP ] Conf ] Yijie Han , Yoshihide Igarashi , Kumiko Kanai , Kinya Miura Fault-Tolerant Broadcasting in Binary Jumping Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Eiji Miyano Routing Problems on the Mesh of Buses. [Citation Graph (0, 0)][DBLP ] Conf ] Shuji Jimbo , Akira Maruoka Selection Networks with 8n log2 n Size and O (log n ) Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson Boolean Circuit Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Antonios Symvonis , Spyros Tragoudas Searching a Solid Pseudo 3-Sided Orthoconvex Grid. [Citation Graph (0, 0)][DBLP ] Conf ] Nick D. Dendris , Iannis A. Kalafatis , Lefteris M. Kirousis An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Kokichi Sugihara Topologically Consistent Algorithms Realted to Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Seung-Hak Choi , Sung Yong Shin , Kyung-Yong Chwa Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Toshiya Itoh , Kenji Horikawa On the Complexity of Composite Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Kojiro Kobayashi On Malign Input Distributions for Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Johannes Köbler , Martin Mundhenk Lowness and the Complexity of Sparse and Tally Descriptions. [Citation Graph (0, 0)][DBLP ] Conf ] Jie Wang , Jay Belanger Honest Iteration Schemes of Randomizing Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] H. S. Lee , R. C. Chang Approximating Vertices of a Convex Polygon with Grid Points in the Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Akutsu Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Esther Jennings , Andrzej Lingas On the Relationship among Constrained Geometric Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Madlener , Friedrich Otto , Andrea Sattler-Klein Generating Small Convergent Systems Can Be Extremely Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Mizuhito Ogawa Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Bolignano , Mourad Debbabi Higher Order Communication Processes with Value-Passing, Assignment and Return of Results. [Citation Graph (0, 0)][DBLP ] Conf ] Wim Pijls , Arie de Bruin Searching Informed Game Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Masao Iri How to Generate Realistic Sample Problems for Network Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Silvano Martello , Paolo Toth Generalized Assignment Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Guévremont , Jack Snoeyink Recognizing an Envelope of Lines in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] W. S. Chan , F. Chin Approximation of Polygonal Curves with Minimum Number of Line Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Majid Sarrafzadeh , Dorothea Wagner , Frank Wagner , Karsten Weihe Wiring Knock-Knee Layouts: A Global Appoach. [Citation Graph (0, 0)][DBLP ] Conf ] Jun-ya Takahashi , Hitoshi Suzuki , Takao Nishizeki Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Longpré , Osamu Watanabe On Symmetry of Information and Polynomial Time Invertibility. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , Jun Tarui , Seinosuke Toda On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. [Citation Graph (0, 0)][DBLP ] Conf ] Kaoru Kurosawa , Osamu Watanabe Computational and Statistical Indistinguishabilities. [Citation Graph (0, 0)][DBLP ] Conf ] Bin Fu , Hong-Zhou Li On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Majid Sarrafzadeh , D. T. Lee Rstricted Track Assignment with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Wen-Lian Hsu A Simple Test for the Consecutive Ones Property. [Citation Graph (0, 0)][DBLP ] Conf ] Koji Hakata , Hiroshi Imai The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Ka Hing Lee The Implicit Dictionary Problem Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Reinhardt Sorting In-Place with a Worst Case Complexity of n log n -1.3n + O (logn ) Comparisons and epsilon n log n + O (1) Transports. [Citation Graph (0, 0)][DBLP ] Conf ] Alistair Moffat , Ola Petersson , Nicholas C. Wormald Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP ] Conf ] 