Conferences in DBLP
Ran Adler , Yossi Azar Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Lars Arge , Gerth Stølting Brodal , Jeffrey Scott Vitter I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir Motion Planning of a Ball Amid Segments in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Sanjeev Arora , Sanjeev Khanna Page Replacement for General Caching Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Gunnar Andersson , Lars Engebretsen , Johan Håstad A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p . [Citation Graph (0, 0)][DBLP ] Conf ] Javed A. Aslam , Katya Pelekhov , Daniela Rus A Practical Clustering Algorithm for Static and Dynamic Information Organization. [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Avivit Kapah-Levy Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda Using Homogenous Weights for Approximating the Partial Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Sariel Har-Peled Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Martin Farach-Colton , Shibu Yooseph , Lisa Zhang Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Basch , Jeff Erickson , Leonidas J. Guibas , John Hershberger , Li Zhang Kinetic Collision Detection Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Berenbrink , Christian Scheideler Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh , Jack Snoeyink Queries with Segments in Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Prosenjit Bose , Erik D. Demaine , Anna Lubiw Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Boyer , Wendy J. Myrvold Stop Minding Your p's and q's: A Simplified O (n ) Planar Embedding Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] David Bryant , Mike A. Steel Fast Algorithms for Constructing Optimal Trees from Quartets. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Capalbo A Small Universal Graph for Bounded-degree Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan A Near-Linear Area Bound for Drawing Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Barun Chandra , Magnús M. Halldórsson Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Jon M. Kleinberg , Ravi Kumar , Sridhar Rajagopalan , Amit Sahai , Andrew Tomkins Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna On Multi-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen , Xin He , Ming-Yang Kao Nonplanar Topological Inference and Political-Map Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Tamal K. Dey Approximate Minimum Weight Steiner Triangulation in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Jen Chiang , Joseph S. B. Mitchell Two-Point Euclidean Shortest Path Queries in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Ka Wong Chong , Yijie Han , Tak Wah Lam On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan Dynamic LCA Queries on Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan , Piotr Indyk Tree Pattern Matching and Subset Matching in Deterministic O (n log3 n )-time. [Citation Graph (0, 0)][DBLP ] Conf ] Lenore Cowen Compact Routing with Minimum Stretch. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Csürös , Ming-Yang Kao Recovering Evolutionary Trees Through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Przemyslawa Kanarek , Miroslaw Kutylowski , Krzysztof Lorys Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas On Approximability of the Minimum-Cost k -Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Petros Drineas , Alan M. Frieze , Ravi Kannan , Santosh Vempala , V. Vinay Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov Balanced Aspect Ratio Trees: Combining the Advantages of k -d Trees and Octrees. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , David Hart Shortest Paths in an Arrangement with k Line Orientations. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , John Noga , Steven S. Seiden , Jiri Sgall , Gerhard J. Woeginger Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson , Leonidas J. Guibas , Jorge Stolfi , Li Zhang Separation-Sensitive Collision Detection for Convex Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Lei Zhao Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Tibor Jordán How to Make a Square Grid Framework with Cables Rigid. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , David P. Williamson Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. [Citation Graph (0, 0)][DBLP ] Conf ] Paul W. Goldberg , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk , Andrew V. Goldberg , Kostas Tsioutsiouliklis Cut Tree Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP ] Conf ] Michael H. Goldwasser Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Guattery , Gary L. Miller , Noel Walkington Estimating Interpolation Error: A Combinatorial Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Fast Deterministic Construction of Static Dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Yijie Han , Xiaojun Shen Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP ] Conf ] Lenwood S. Heath , Nicholas A. Loehr New Algorithms for Generating Conway Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Stefano Leonardi Scheduling Multicasts on Unit-Capacity Trees and Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Hougardy , Hans Jürgen Prömel A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk A Small Approximately min-wise Independent Family of Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Eiji Miyano An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. [Citation Graph (0, 0)][DBLP ] Conf ] Satoru Iwata Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Ion I. Mandoiu , Vijay V. Vazirani , David P. Williamson A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Lorant Porkolab Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Eliminating Migration in Multi-Processor Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Mario Szegedy On-line Complexity of Monotone Set Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Kawazoe , Tetsuo Shibuya , Takeshi Tokuyama Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. [Citation Graph (0, 0)][DBLP ] Conf ] Paul E. Kearney , Ming Li , John Tsang , Tao Jiang Recovering Branches on the Tree of Life: An Approximation Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Nicolas Schabanel The Data Broadcast Problem with Non-Uniform Transmission Rimes. [Citation Graph (0, 0)][DBLP ] Conf ] Tracy Kimbrel Interleaved Prefetching. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Amit Kumar Wavelength Conversion in Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Anton J. Kleywegt , Vijay S. Nori , Martin W. P. Savelsbergh , Craig A. Tovey Online Resource Minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Madhukar R. Korupolu , C. Greg Plaxton , Rajmohan Rajaraman Placement Algorithms for Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , David Scot Taylor Indexing Schemes for Random Points. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , D. Sivakumar Roundness Estimation via Random Sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Richard E. Ladner , James D. Fix , Anthony LaMarca Cache Performance Analysis of Traversals and Random Accesses. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Kar-Keung To Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] J. Kevin Lanctot , Ming Li , Bin Ma , Shaojiu Wang , Louxin Zhang Distinguishing String Selection Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton , Satish Rao , Aravind Srinivasan New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Liberatore Empirical Investigation of the Markov Reference Model. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini An Analysis of the Burrows-Wheeler Transform. [Citation Graph (0, 0)][DBLP ] Conf ] Waleed Meleis , Edward S. Davidson Dual-Issue Scheduling with Spills for Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kamesh Munagala , Abhiram G. Ranade I/O-Complexity of Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Lata Narayanan , Jaroslav Opatrny , Dominique Sotteau All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey D. Oldham Combinatorial Approximation Algorithms for Generalized Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan , Yanqiang Yu Certified Computation of the Sign of a Matrix Determinant. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Rendering Equation Revisited: How to Avoid Explicit Visibility Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Balaji Raghavachari , Jeyakesavan Veerasamy Approximation Algorithms for the Asymmetric Postman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Rajagopalan , Vijay V. Vazirani On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Joe Sawada , Frank Ruskey An Efficient Algorithm for Generating Necklaces with Fixed Density. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Schuurman , Gerhard J. Woeginger Preemptive Scheduling with Job-Dependent Setup Times. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Shallit , David Swart An Efficient Algorithm for Computing the i th letter of 4n a. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Siegel Median Bounds and Their Application. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Smith , Subhash Suri Rectangular Tiling in Multi-dimensional Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] C. R. Subramanian A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Kasturi R. Varadarajan , Pankaj K. Agarwal Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin D. Wayne A New Property and a Faster Algorithm for Baseball Elimination. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? [Citation Graph (0, 0)][DBLP ] Conf ] Yunhong Zhou , Subhash Suri Analysis of a Bounding Box Heuristic for Object Intersection. [Citation Graph (0, 0)][DBLP ] Conf ] Richa Agarwala , Leslie G. Biesecker , Alejandro A. Schäffer Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred Populations. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Klaus Kursawe , Sven Schuierer Exploring Unknown Environments with Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Stephen A. Bloch , David L. Schweizer Playing Twenty Questions with a Procrastinator. [Citation Graph (0, 0)][DBLP ] Conf ] Javed A. Aslam , April Rasala , Clifford Stein , Neal E. Young Improved Bicriteria Existence Theorems for Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Ateniese , Gene Tsudik Group Signatures Á la carte . [Citation Graph (0, 0)][DBLP ] Conf ] Ulrike Axen Computing Morse Functions on Triangulated Manifolds. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan D. Baev , Waleed Meleis , Alexandre E. Eichenberger Algorithms for Total Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker Parameterized diff. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel Finding Maximum Independent Sets in Sparse and General Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tanya Y. Berger-Wolf , Edward M. Reingold Optimal Multichannel Communication Under Failure. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Berry A Wide-Range Efficient Algorithm for Minimal Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Sariel Har-Peled Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Randeep Bhatia , Samir Khuller , Robert Pless , Yoram J. Sussmann The Full Degree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Erik D. Demaine , Martin L. Demaine , Sylvain Lazard , Anna Lubiw , Joseph O'Rourke , Mark H. Overmars , Steve Robbins , Ileana Streinu , Godfried T. Toussaint , Sue Whitesides Locked and Unlocked Polygonal Chains in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Matt Blaze , Joan Feigenbaum , Moni Naor A Formal Treatment of Remotely Keyed Encryption. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Michael Mitzenmacher , Laurent Moll Unscrambling Address Lines. [Citation Graph (0, 0)][DBLP ] Conf ] Kathie Cameron , Jack Edmonds Some Graphic Uses of an Even Number of Odd Nodes. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Rajeev Motwani Minimizing Weighted Completion Time on a Single Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Fabián A. Chudak , David B. Shmoys Improved Approximation Algorithms for a Capacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Edward G. Coffman Jr. , Alexander L. Stolyar Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Haim Kaplan LP-based Analysis of Greedy-dual-size. [Citation Graph (0, 0)][DBLP ] Conf ] Johanne Cohen , Pierre Fraigniaud , Margarida Mitjana Scheduling Calls for Multicasting in Tree-Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart LBFS Orderings and Cocomparability Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lenore Cowen , Christopher G. Wagner Compact Roundtrip Routing for Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Celina M. Herrera de Figueiredo , Luerbio Faria , Candido Ferreira Xavier de Mendonça Neto Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. [Citation Graph (0, 0)][DBLP ] Conf ] Frank K. H. A. Dehne , Wolfgang Dittrich , David A. Hutchinson , Anil Maheshwari Parallel Virtual Memory. [Citation Graph (1, 0)][DBLP ] Conf ] Erik D. Demaine , Martin L. Demaine , Anna Lubiw Folding and One Straight Cut Suffice. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Piyush Kumar A Simple Provable Algorithm for Curve Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo , Yair Frankel Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis , Venkatesan Guruswami , Sanjeev Khanna The 2-Catalog Segmentation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Incremental and Decremental Maintenance of Planar Width. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Finkler , Kurt Mehlhorn Checking Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Randomized Splay Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Jesper Jansson , Andrzej Lingas Efficient Approximation Algorithms for the Hamming Center Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jordan Gergov Algorithms for Compile-Time Memory Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Phillip B. Gibbons , Yossi Matias Synopsis Data Structures for Massive Data Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Bernard M. E. Moret Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Grebinski , Gregory Kucherov Reconstructing Set Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson Online Coloring Known Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory L. Heileman , Chaouki T. Abdallah , Bernard M. E. Moret , Bradley J. Smith Dynamical System Representation of Open Address Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Huber Efficient Exact Sampling from the Ising Model Using Swendsen-Wang. [Citation Graph (0, 0)][DBLP ] Conf ] Louis Ibarra Fully Dynamic Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Istrate The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications. [Citation Graph (0, 0)][DBLP ] Conf ] David S. Johnson , Mario Szegedy What are the Least Tractable Instances of max Tndependent Set? [Citation Graph (0, 0)][DBLP ] Conf ] Anna M. Johnston A Generalized q th Root Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu Computing Nearest Neighbors for Moving Points and Applications to Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Stephen R. Tate Designing Proxies for Stock Market Indices is Computationally Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Martin Strauss , Mario Szegedy Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Balaji Raghavachari , An Zhu A Uniform Framework for Approximating Weighted Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Gang Li , Frank Ruskey The Advantages of Forward Thinking in Generating Rooted and Free Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Luis-Miguel Lopez , Philippe Narbel An Algorithm to Symbolically Describe Flows on Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias , Süleyman Cenk Sahinalp On the Optimality of Parsing in Dynamic Dictionary Based Data Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Giancarlo Mauri , Giulio Pavesi , Antonio Piccolboni Approximation Algorithms for Protein Folding Prediction. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Mazoyer , Codrin M. Nichitiu , Eric Rémila Compass Permits Leader Election. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Müller-Hannemann Combinatorics Helps for Hexahedral Mesh Generation in CAD. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Nutov Approximating Multiroot 3-Outconnected Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Pak Using Stopping Times to Bound Mixing Times. [Citation Graph (0, 0)][DBLP ] Conf ] Allon G. Percus , David C. Torney Greedy Algorithms for Optimized DNA Sequencing. [Citation Graph (0, 0)][DBLP ] Conf ] Vijaya Ramachandran , Brian Grayson , Michael Dahlin Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall , David Wilson Sampling Spin Configurations of an Ising System. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Scharbrodt , Angelika Steger , Horst Weisser Approximability of Scheduling with Fixed Jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Jay Sethuraman , Mark S. Squillante Optimal Scheduling of Multiclass Parallel Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Schiermeyer , Bert Randerath Colouring Graphs with Prescribed Induced Cycle Lengths. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas S. Schulz , Robert Weismantel An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Suri , George Varghese Packet Filtering in High Speed Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mario Szegedy A Slique Size Bounding Technique with Application to Non-Linear Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Torng , Patchrawat Uthaisombut Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Santosh Vempala , Mihalis Yannakakis A Convex Relaxation for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Narayan Vikas Computational Complexity of Compaction to Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Warme , Pawel Winter , Martin Zachariasen Exact Solutions to Large-scale Plane Steiner Tree Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin D. Wayne , Lisa Fleischer Faster Approximation Algorithms for Generalized Flow. [Citation Graph (0, 0)][DBLP ] Conf ] Rebecca N. Wright , Sara Spalding Experimental Performance of Shared RSA Modulus Generation. [Citation Graph (0, 0)][DBLP ] Conf ] Xinyu Xiang , Martin Held , Joseph S. B. Mitchell Fast and Effective Stripification of Polygonal Surface Models. [Citation Graph (0, 0)][DBLP ] Conf ] 