Conferences in DBLP
Andrew Chi-Chih Yao Interactive Proofs for Quantum Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Takao Nishizeki Drawing Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jinhee Chun , Kunihiko Sadakane , Takeshi Tokuyama Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Maheshwari , Michiel H. M. Smid A Dynamic Dictionary for Priced Information with Application. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsushi Nishida , Kokichi Sugihara Voronoi Diagram in the Flow Field. [Citation Graph (0, 0)][DBLP ] Conf ] Ovidiu Daescu , Ningfang Mi Polygonal Path Approximation: A Query Based Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Berry , Pinar Heggernes , Yngve Villanger A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Atsuko Yamaguchi , Hiroshi Mamitsuka Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ornan Ori Gerstel , Shay Kutten , Rachel Matichin , David Peleg Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rung-Ren Lin , Wen-Hsiung Kuo , Kun-Mao Chao Finding a Length-Constrained Maximum-Density Path in a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Bodo Manthey , Rüdiger Reischuk The Intractability of Computing the Hamming Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , Lance Fortnow , Frank Stephan Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Shao Chin Sung , Keisuke Tanaka Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Tomoyuki Yamakami Computational Complexity Measures of Multipartite Quantum Entanglement. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Valiente A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Kohei Okada Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Iyad A. Kanj , Ge Xia Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroaki Yamamoto A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Rainer Schuler The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hirotada Kobayashi Non-interactive Quantum Perfect and Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Hirotada Kobayashi , Keiji Matsumoto , Tomoyuki Yamakami Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ludwig A Faster Lattice Reduction Method Using Quantum Search. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry Three Sorting Algorithms Using Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Grzegorz Stachowiak Lower Bounds on Correction Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gonzalo Navarro Approximate Regular Expression Searching with Arbitrary Integer Weights. [Citation Graph (0, 0)][DBLP ] Conf ] Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung Constructing Compressed Suffix Arrays with Large Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Annette Ebbers-Baumann , Ansgar Grüne , Rolf Klein On the Geometric Dilation of Finite Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Jae-Sook Cheong , Herman J. Haverkort , A. Frank van der Stappen On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. [Citation Graph (0, 0)][DBLP ] Conf ] José Miguel Díaz-Báñez , Ferran Hurtado , Mario Alberto López , Joan Antoni Sellarès Optimal Point Set Projections onto Regular Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Yuusuke Abe An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Sören Laue A Faster Algorithm for Two-Variable Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu Efficient Algorithms for Generation of Combinatorial Covering Suites. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiyuki Karuno , Hiroshi Nagamochi A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. [Citation Graph (0, 0)][DBLP ] Conf ] Deshi Ye , Guochuan Zhang Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Yaw-Ling Lin , Tsan-sheng Hsu Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. [Citation Graph (0, 0)][DBLP ] Conf ] Isaac Elias Settling the Intractability of Multiple Alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , N. Lu , Hing-Fung Ting , Prudence W. H. Wong , Siu-Ming Yiu Efficient Algorithms for Optimizing Whole Genome Alignment with Noise. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaodong Wu Segmenting Doughnut-Shaped Objects in Medical Images. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Kwok Dai , Hung-Chi Su On the Locality Properties of Space-Filling Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Stefan Langerman , Joseph O'Rourke Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Seok-Hee Hong , Peter Eades Symmetric Layout of Disconnected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Chlebík , Janka Chlebíková Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Takki-Chebihi , Takeshi Tokuyama Enumerating Global Roundings of an Outerplanar Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Shigeyuki Yamamoto , Hiroshi Nagamochi Augmenting Forests to Meet Odd Diameter Requirements. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina Bazgan , Zsolt Tuza , Daniel Vanderpooten On the Existence and Determination of Satisfactory Partitions in a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Tom Altman , Yoshihide Igarashi , Michiko Omori A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. [Citation Graph (0, 0)][DBLP ] Conf ] Abul Kashem , M. Ziaur Rahman An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David J. Abraham , Robert W. Irving , David Manlove The Student-Project Allocation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich , Leonid Khachiyan Algorithms for Enumerating Circuits in Matroids. [Citation Graph (0, 0)][DBLP ] Conf ] Akinobu Eguchi , Satoru Fujishige , Akihisa Tamura A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. [Citation Graph (0, 0)][DBLP ] Conf ] Wing-Kai Hon , Kunihiko Sadakane , Wing-Kin Sung Succinct Data Structures for Searchable Partial Sums. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Krizanc , Pat Morin , Michiel H. M. Smid Range Mode and Range Median Queries on Lists and Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Christian Deppe Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. [Citation Graph (0, 0)][DBLP ] Conf ] Travis Gagie New Ways to Construct Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas , Johan Nilsson Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaella Gentilini , Alberto Policriti Biconnectivity on Symbolically Represented Graphs: A Linear Solution. [Citation Graph (0, 0)][DBLP ] Conf ] Torsten Tholey A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémy Barbay , Claire Kenyon Deterministic Algorithm for the t-Threshold Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Christos Kaklamanis , Panagiotis Kanellopoulos Energy-Efficient Wireless Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Stamatis Stefanakos Wavelength Conversion in Shortest-Path All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan , Sven Oliver Krumke , Till Nierhoff A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Eidenbenz , Aris Pagourtzis , Peter Widmayer Flexible Train Rostering. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bürgisser , Felipe Cucker Counting Complexity Classes over the Reals I: The Additive Case. [Citation Graph (0, 0)][DBLP ] Conf ] Atsuyuki Inoue , Akira Ito , Katsushi Inoue , Tokio Okazaki Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Clemente Galdi Hypergraph Decomposition and Secret Sharing. [Citation Graph (0, 0)][DBLP ] Conf ] Eun-Kyung Ryu , Kee-Won Kim , Kee-Young Yoo A Promising Key Agreement Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Michael W. Mahoney , Ravi Montenegro Rapid Mixing of Several Markov Chains for a Hard-Core Model. [Citation Graph (0, 0)][DBLP ] Conf ] Tomomi Matsui , Mitsuo Motoki , Naoyuki Kamatani Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshio Okamoto Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. [Citation Graph (0, 0)][DBLP ] Conf ] George Karakostas , Anastasios Viglas Equilibria for Networks with Malicious Users. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Ziegler Quasi-optimal Arithmetic for Quaternion Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Piyush P. Kurur Upper Bounds on the Complexity of Some Galois Theory Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Wieland Fischer , Jean-Pierre Seifert Unfolded Modular Multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Soonhak Kwon , Chang Hoon Kim , Chun Pyo Hong Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic. [Citation Graph (0, 0)][DBLP ] Conf ] 