Search results for "SWAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Sasanka Roy, Partha P. Goswami, Sandip Das 0001, Subhas C. Nandy	Optimal Algorithm for a Special Point-Labeling Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Peter Sanders 0001, Berthold Vöcking	Random Arc Allocation and Applications.	SWAT	2002	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro	Robot Localization without Depth Perception.	SWAT	2002	DBLP DOI BibTeX RDF
1	Partha P. Goswami, Sandip Das 0001, Subhas C. Nandy	Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.	SWAT	2002	DBLP DOI BibTeX RDF
1	Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski	Approximability of Dense Instances of NEAREST CODEWORD Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Stephan J. Eidenbenz	Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.	SWAT	2002	DBLP DOI BibTeX RDF
1	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.	SWAT	2002	DBLP DOI BibTeX RDF	computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph
1	Heikki Mannila	Combining Pattern Discovery and Probabilistic Modeling in Data Mining.	SWAT	2002	DBLP DOI BibTeX RDF
1	Martti Penttonen, Erik Meineche Schmidt (eds.)	Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings	SWAT	2002	DBLP DOI BibTeX RDF
1	Torben Hagerup, Rajeev Raman	An Efficient Quasidictionary.	SWAT	2002	DBLP DOI BibTeX RDF
1	Clint Hepner, Clifford Stein 0001	Minimizing Makespan for the Lazy Bureaucrat Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Zhongping Qin, Binhai Zhu	A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.	SWAT	2002	DBLP DOI BibTeX RDF
1	Jochen Alber, Michael R. Fellows, Rolf Niedermeier	Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.	SWAT	2002	DBLP DOI BibTeX RDF
1	Jyrki Katajainen, Tomi Pasanen	A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.	SWAT	2002	DBLP DOI BibTeX RDF
1	Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson	Powers of Geometric Intersection Graphs and Dispersion Algorithms.	SWAT	2002	DBLP DOI BibTeX RDF
1	Jyrki Katajainen, Jeppe Nejsum Madsen	Performance Tuning an Algorithm for Compressing Relational Tables.	SWAT	2002	DBLP DOI BibTeX RDF
1	Jens S. Frederiksen, Kim S. Larsen	Packet Bundling.	SWAT	2002	DBLP DOI BibTeX RDF
1	Monaldo Mastrolilli	A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times.	SWAT	2002	DBLP DOI BibTeX RDF
1	John A. Ellis, Hongbing Fan, Michael R. Fellows	The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.	SWAT	2002	DBLP DOI BibTeX RDF	graph, dominating set, fixed parameter algorithm, genus
1	Sarnath Ramnath	Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm.	SWAT	2002	DBLP DOI BibTeX RDF
1	Kouji Arata, Satoru Iwata 0001, Kazuhisa Makino, Satoru Fujishige	Locating Sources to Meet Flow Demands in Undirected Networks.	SWAT	2000	DBLP DOI BibTeX RDF
1	Shlomo Ahal, Yuri Rabinovich	On the Complexity of the Sub-permutation Problem.	SWAT	2000	DBLP DOI BibTeX RDF
1	Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde	Embeddings of k-Connected Graphs of Pathwidth k.	SWAT	2000	DBLP DOI BibTeX RDF
1	Lars Arge, Jakob Pagter	I/O-Space Trade-Offs.	SWAT	2000	DBLP DOI BibTeX RDF
1	Vincenzo Liberatore	Scheduling Jobs Before Shut-Down.	SWAT	2000	DBLP DOI BibTeX RDF
1	Esko Ukkonen	Toward Complete Genome Data Mining in Computational Biology.	SWAT	2000	DBLP DOI BibTeX RDF
1	Tetsuo Shibuya	Generalization of a Suffix Tree for RNA Structural Pattern Matching.	SWAT	2000	DBLP DOI BibTeX RDF
1	Mikkel Thorup, David R. Karger	Dynamic Graph Algorithms with Applications.	SWAT	2000	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Hristo N. Djidjev	A Dynamic Algorithm for Maintaining Graph Partitions.	SWAT	2000	DBLP DOI BibTeX RDF
1	David Peleg	Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems.	SWAT	2000	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir	Computing the Penetration Depth of Two Convex Polytopes in 3D.	SWAT	2000	DBLP DOI BibTeX RDF
1	Piotr Berman	A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs.	SWAT	2000	DBLP DOI BibTeX RDF
1	Ming-Yang Kao, Jared Samet, Wing-Kin Sung	The Enhanced Double Digest Problem for DNA Physical Mapping.	SWAT	2000	DBLP DOI BibTeX RDF	graph-theoretic techniques, NP-hardness, fast algorithms, physical mapping
1	Peter Damaschke	Parallel Attribute-Efficient Learning of Monotone Boolean Functions.	SWAT	2000	DBLP DOI BibTeX RDF
1	Robert W. Irving, David F. Manlove, Sandy Scott	The Hospitals/Residents Problem with Ties.	SWAT	2000	DBLP DOI BibTeX RDF
1	Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici	Least Adaptive Optimal Search with Unreliable Tests.	SWAT	2000	DBLP DOI BibTeX RDF
1	Claus Rick	Efficient Computation of All Longest Common Subsequences.	SWAT	2000	DBLP DOI BibTeX RDF
1	Grzegorz Stachowiak	Fibonacci Correction Networks.	SWAT	2000	DBLP DOI BibTeX RDF
1	John Iacono	Improved Upper Bounds for Pairing Heaps.	SWAT	2000	DBLP DOI BibTeX RDF
1	Stephen Alstrup, Jacob Holm, Mikkel Thorup	Maintaining Center and Median in Dynamic Trees.	SWAT	2000	DBLP DOI BibTeX RDF
1	Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier	Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.	SWAT	2000	DBLP DOI BibTeX RDF
1	Leonidas Palios	A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon.	SWAT	2000	DBLP DOI BibTeX RDF	curve with increasing chords, kernel, Motion planning, simple polygon, competitive algorithm
1	Yossi Azar, Leah Epstein	On-Line Scheduling with Precedence Constraints.	SWAT	2000	DBLP DOI BibTeX RDF
1	Rasmus Pagh	A New Trade-Off for Deterministic Dictionaries.	SWAT	2000	DBLP DOI BibTeX RDF
1	Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan	Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.	SWAT	2000	DBLP DOI BibTeX RDF
1	Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer	Approximation Algorithms for Clustering to Minimize the Sum of Diameters.	SWAT	2000	DBLP DOI BibTeX RDF
1	Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya	A Blocked All-Pairs Shortest-Path Algorithm.	SWAT	2000	DBLP DOI BibTeX RDF	cache, blocking, speedup, All pairs shortest paths
1	Yefim Dinitz, Ronit Nossenson	Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph.	SWAT	2000	DBLP DOI BibTeX RDF
1	Refael Hassin, Shlomi Rubinstein	Robust Matchings and Maximum Clustering.	SWAT	2000	DBLP DOI BibTeX RDF
1	Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger	Caching for Web Searching.	SWAT	2000	DBLP DOI BibTeX RDF
1	Magnús M. Halldórsson (eds.)	Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings	SWAT	2000	DBLP DOI BibTeX RDF
1	Refael Hassin, Shlomi Rubinstein	Approximation Algorithms for Maximum Linear Arrangement.	SWAT	2000	DBLP DOI BibTeX RDF
1	Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede	Optimal Flow Aggregation.	SWAT	2000	DBLP DOI BibTeX RDF
1	Leonidas J. Guibas, Jack Snoeyink, Li Zhang 0001	Compact Voronoi Diagrams for Moving Convex Polygons.	SWAT	2000	DBLP DOI BibTeX RDF
1	Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan	Efficient Expected-Case Algorithms for Planar Point Location.	SWAT	2000	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Pinar Heggernes	Recognizing Weakly Triangulated Graphs by Edge Separability.	SWAT	2000	DBLP DOI BibTeX RDF
1	Uriel Feige	Coping with the NP-Hardness of the Graph Bandwidth Problem.	SWAT	2000	DBLP DOI BibTeX RDF
1	Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda	Max- and Min-Neighborhood Monopolies.	SWAT	2000	DBLP DOI BibTeX RDF
1	Michael A. Bender, Saurabh Sethia, Steven Skiena	Data Structures for Maintaining Set Partitions.	SWAT	2000	DBLP DOI BibTeX RDF
1	Toshimasa Ishii, Hiroshi Nagamochi	On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph.	SWAT	2000	DBLP DOI BibTeX RDF
1	Lars Arge, Gerth Stølting Brodal, Laura Toma	On External-Memory MST, SSSP, and Multi-way Planar Graph Separation.	SWAT	2000	DBLP DOI BibTeX RDF
1	Yossi Azar, Leah Epstein, Rob van Stee	Resource Augmentation in Load Balancing.	SWAT	2000	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama	On the Complexities of the Optimal Rounding Problems of Sequences and Matrices.	SWAT	2000	DBLP DOI BibTeX RDF
1	Andreas Björklund	Optimal Adaptive Fault Diagnosis of Hypercubes.	SWAT	2000	DBLP DOI BibTeX RDF
1	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	On Graph Powers for Leaf-Labeled Trees.	SWAT	2000	DBLP DOI BibTeX RDF
1	Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen	Fair versus Unrestricted Bin Packing.	SWAT	2000	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Riko Jacob	Dynamic Planar Convex Hull with Optimal Query Time.	SWAT	2000	DBLP DOI BibTeX RDF
1	Gianluca De Marco, Luisa Gargano, Ugo Vaccaro	Concurrent Multicast in Weighted Networks.	SWAT	1998	DBLP DOI BibTeX RDF
1	Frank Hoffmann 0002, Christian Icking, Rolf Klein, Klaus Kriegel	Moving an Angle Around a Region.	SWAT	1998	DBLP DOI BibTeX RDF	Angle hull, arrangements of circles, curve length, envelopes of circles, computational geometry, convex hull, motion planning, polygon
1	Johan Håstad	Some Recent Strong Inapproximability Results.	SWAT	1998	DBLP DOI BibTeX RDF
1	Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann	Facility Location with Dynamic Distance Function (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF
1	Roberto Grossi, Andrea Pietracaprina, Geppino Pucci	Optimal Deterministic Protocols for Mobile Robots on a Grid.	SWAT	1998	DBLP DOI BibTeX RDF
1	Stefan Arnborg, Lars Ivansson (eds.)	Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings	SWAT	1998	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.	SWAT	1998	DBLP DOI BibTeX RDF
1	Haim Kaplan, Chris Okasaki, Robert Endre Tarjan	Simple Confluently Persistent Catenable Lists (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Jyrki Katajainen	Worst-Case External-Memory Priority Queues.	SWAT	1998	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Riko Jacob, Madhav V. Marathe	Formal Language Constrained Path Problems.	SWAT	1998	DBLP DOI BibTeX RDF
1	Klaus Jansen	An Approximation Scheme for Bin Packing with Conflicts.	SWAT	1998	DBLP DOI BibTeX RDF
1	Steven S. Seiden	Randomized Online Multi-threaded Paging.	SWAT	1998	DBLP DOI BibTeX RDF
1	Nora Sleumer	Output-Sensitive Cell Enumeration in Hyperplane Arrangements.	SWAT	1998	DBLP DOI BibTeX RDF
1	Sandeep Sen, Neelima Gupta	Distribution-Sensitive Algorithms.	SWAT	1998	DBLP DOI BibTeX RDF
1	Edward A. Hirsch	Local Search Algorithms for SAT: Worst-Case Analysis.	SWAT	1998	DBLP DOI BibTeX RDF
1	Piotr Berman, Chris Coulston	Speed is More Powerful than Claivoyance.	SWAT	1998	DBLP DOI BibTeX RDF
1	Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne	Approximations for the General Block Distribution of a Matrix.	SWAT	1998	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Jinhui Xu 0001	Two-Variable Linear Programming in Parallel.	SWAT	1998	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg	Recent Developments in Maximum Flow Algorithms (Invited Lecture).	SWAT	1998	DBLP DOI BibTeX RDF
1	Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels	Models and Motion Planning.	SWAT	1998	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Maria Cristina Pinotti	Comparator Networks for Binary Heap Construction.	SWAT	1998	DBLP DOI BibTeX RDF
1	Matthew J. Katz, Klara Kedem, Michael Segal 0001	Constrained Square-Center Problems.	SWAT	1998	DBLP DOI BibTeX RDF
1	Thorsten Graf, Kamakoti Veezhinathan	An Optimal Algorithm for Computing Vissible Nearest Foreign Neighbors Among Colored Line Segments.	SWAT	1998	DBLP DOI BibTeX RDF
1	Jop F. Sibeyn	Solving Fundamental Problems on Sparse-Meshes.	SWAT	1998	DBLP DOI BibTeX RDF
1	Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan	Probabilistic Data Structures for Priority Queues (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF	probabilistic data structures, decrease key, meld, bottom-up sampling, buffering technique, priority queue, skip list, amortization
1	David Zuckerman	Extractors for Weak Random Sources and Their Applications.	SWAT	1998	DBLP DOI BibTeX RDF
1	Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir	On the Number of Regular Vertices of the Union of Jordan Regions.	SWAT	1998	DBLP DOI BibTeX RDF
1	Venkatesh Raman 0001, Sarnath Ramnath	Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage.	SWAT	1998	DBLP DOI BibTeX RDF
1	Meena Mahajan, V. Vinay	Determinant: Old Algorithms, New Insights (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF
1	Hans-Martin Will	Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology.	SWAT	1998	DBLP DOI BibTeX RDF
1	Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle	Memory Requirements for Table Computations in Partial k-tree Algorithms.	SWAT	1998	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	Minimal Elimination of Planar Graphs.	SWAT	1998	DBLP DOI BibTeX RDF
1	Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano	A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees.	SWAT	1996	DBLP DOI BibTeX RDF

Publications at "SWAT"( http://dblp.L3S.de/Venues/SWAT )