|
|
Conferences in DBLP
- Torben Hagerup, Rajeev Raman
An Efficient Quasidictionary. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:1-18 [Conf]
- Heikki Mannila
Combining Pattern Discovery and Probabilistic Modeling in Data Mining. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:19- [Conf]
- Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
Time and Space Efficient Multi-method Dispatching. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:20-29 [Conf]
- John E. Augustine, Steven S. Seiden
Linear Time Approximation Schemes for Vehicle Scheduling. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:30-39 [Conf]
- Clint Hepner, Clifford Stein
Minimizing Makespan for the Lazy Bureaucrat Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:40-50 [Conf]
- Monaldo Mastrolilli
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:51-59 [Conf]
- Stephan Eidenbenz
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:60-68 [Conf]
- Partha P. Goswami, Sandip Das, Subhas C. Nandy
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:69-79 [Conf]
- Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:80-89 [Conf]
- Nissan Lev-Tov, David Peleg
Exact Algorithms and Approximation Schemes for Base Station Placement Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:90-99 [Conf]
- Zhongping Qin, Binhai Zhu
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:100-109 [Conf]
- Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
Optimal Algorithm for a Special Point-Labeling Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:110-120 [Conf]
- Peter Sanders, Berthold Vöcking
Random Arc Allocation and Applications. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:121-130 [Conf]
- Micha Sharir, Shakhar Smorodinsky
On Neighbors in Geometric Permutations. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:131-139 [Conf]
- Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Powers of Geometric Intersection Graphs and Dispersion Algorithms. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:140-149 [Conf]
- Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:150-159 [Conf]
- Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:160-169 [Conf]
- Miroslav Chlebík, Janka Chlebíková
Approximation Hardness of the Steiner Tree Problem on Graphs. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:170-179 [Conf]
- John A. Ellis, Hongbing Fan, Michael R. Fellows
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:180-189 [Conf]
- Harold N. Gabow, Seth Pettie
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:190-199 [Conf]
- Alexander Golynski, Joseph Douglas Horton
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:200-209 [Conf]
- Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
Approximation Algorithms for Edge-Dilation k-Center Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:210-219 [Conf]
- Sarnath Ramnath
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:220-229 [Conf]
- Ron Shamir, Dekel Tsur
Improved Algorithms for the Random Cluster Graph Model. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:230-239 [Conf]
- San Skulrattanakulchai
Delta-List Vertex Coloring in Linear Time. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:240-248 [Conf]
- Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
Robot Localization without Depth Perception. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:249-259 [Conf]
- Alejandro López-Ortiz, Sven Schuierer
Online Parallel Heuristics and Robot Searching under the Competitive Framework. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:260-269 [Conf]
- Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell
Analysis of Heuristics for the Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:270-279 [Conf]
- Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:280-287 [Conf]
- Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
All-Norm Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:288-297 [Conf]
- Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
Approximability of Dense Instances of NEAREST CODEWORD Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:298-307 [Conf]
- R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
Call Control with k Rejections. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:308-317 [Conf]
- Guy Even, Guy Kortsarz, Wolfgang Slany
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:318-327 [Conf]
- Jens S. Frederiksen, Kim S. Larsen
Packet Bundling. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:328-337 [Conf]
- Anuj Puri, Stavros Tripakis
Algorithms for the Multi-constrained Routing Problem. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:338-347 [Conf]
- Juha Kärkkäinen
Computing the Threshold for q-Gram Filters. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:348-357 [Conf]
- Itsik Pe'er, Ron Shamir, Roded Sharan
On the Generality of Phylogenies from Incomplete Directed Characters. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:358-367 [Conf]
- Michael H. Albert, Mike D. Atkinson
Sorting with a Forklift. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:368-377 [Conf]
- Hans L. Bodlaender, Fedor V. Fomin
Tree Decompositions with Small Cost. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:378-387 [Conf]
- Hans L. Bodlaender, Udi Rotics
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:388-397 [Conf]
- Jyrki Katajainen, Jeppe Nejsum Madsen
Performance Tuning an Algorithm for Compressing Relational Tables. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:398-407 [Conf]
- Jyrki Katajainen, Tomi Pasanen
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:408-417 [Conf]
- Tony W. Lai
Paging on a RAM with Limited Resources. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:418-427 [Conf]
- Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan
An Optimal Algorithm for Finding NCA on Pure Pointer Machines. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:428-438 [Conf]
- Eljas Soisalon-Soininen, Peter Widmayer
Amortized Complexity of Bulk Updates in AVL-Trees. [Citation Graph (0, 0)][DBLP]
SWAT, 2002, pp:439-448 [Conf]
|
