Search results for "SWAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Birgit Heydenreich, Rudolf Müller, Marc Uetz	Decentralization and Mechanism Design for Online Machine Scheduling.	SWAT	2006	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001	Minimum Membership Set Covering and the Consecutive Ones Property.	SWAT	2006	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ely Porat, Nira Shafrir	Finding the Position of the k-Mismatch and Approximate Tandem Repeats.	SWAT	2006	DBLP DOI BibTeX RDF
1	Venkatesh Raman 0001, Saket Saurabh 0001	Triangles, 4-Cycles and Parameterized (In-)Tractability.	SWAT	2006	DBLP DOI BibTeX RDF
1	Deepak Ajwani, Tobias Friedrich 0001, Ulrich Meyer 0001	An O(n2.75) Algorithm for Online Topological Ordering.	SWAT	2006	DBLP DOI BibTeX RDF
1	Haim Kaplan, Yahav Nussbaum	A Simpler Linear-Time Recognition of Circular-Arc Graphs.	SWAT	2006	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos 0001	The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.	SWAT	2006	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002	On the Approximation Hardness of Some Generalizations of TSP.	SWAT	2006	DBLP DOI BibTeX RDF
1	Maarten Löffler, Marc J. van Kreveld	Largest and Smallest Tours and Convex Hulls for Imprecise Points.	SWAT	2006	DBLP DOI BibTeX RDF
1	Henrik Blunck, Jan Vahrenhold	In-Place Algorithms for Computing (Layers of) Maxima.	SWAT	2006	DBLP DOI BibTeX RDF
1	Serge Gaspers, Dieter Kratsch, Mathieu Liedloff	Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.	SWAT	2006	DBLP DOI BibTeX RDF
1	Joachim Gudmundsson, Michiel H. M. Smid	On Spanners of Geometric Graphs.	SWAT	2006	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Results and Problems on Self-adjusting Search Trees and Related Data Structures.	SWAT	2006	DBLP DOI BibTeX RDF
1	Matthew J. Katz, Gabriel S. Roisman	On Guarding Rectilinear Domains.	SWAT	2006	DBLP DOI BibTeX RDF
1	Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote	Acyclic Orientation of Drawings.	SWAT	2006	DBLP DOI BibTeX RDF
1	Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Reoptimization of Minimum and Maximum Traveling Salesman's Tours.	SWAT	2006	DBLP DOI BibTeX RDF
1	Michael H. Goldwasser, Mark Pedigo	Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.	SWAT	2006	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan	Generalized Powers of Graphs and Their Algorithmic Use.	SWAT	2006	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Tobias Friedrich 0001, Christian Klein 0001, Ralf Osbild	Unbiased Matrix Rounding.	SWAT	2006	DBLP DOI BibTeX RDF
1	Frank Kammer	Simultaneous Embedding with Two Bends per Edge in Polynomial Area.	SWAT	2006	DBLP DOI BibTeX RDF
1	Josiah Carlson, David Eppstein	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.	SWAT	2006	DBLP DOI BibTeX RDF
1	Raimund Seidel	Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).	SWAT	2006	DBLP DOI BibTeX RDF
1	Joan Boyar, Lene M. Favrholdt	Scheduling Jobs on Grid Processors.	SWAT	2006	DBLP DOI BibTeX RDF
1	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.	SWAT	2006	DBLP DOI BibTeX RDF
1	Leah Epstein, Thomas Erlebach, Asaf Levin	Variable Sized Online Interval Coloring with Bandwidth.	SWAT	2006	DBLP DOI BibTeX RDF
1	Gianni Franceschini	Sorting by Merging or Merging by Sorting?	SWAT	2006	DBLP DOI BibTeX RDF
1	Leah Epstein, Rob van Stee, Tami Tamir	Paging with Request Sets.	SWAT	2006	DBLP DOI BibTeX RDF
1	David J. Abraham, Telikepalli Kavitha	Dynamic Matching Markets and Voting Paths.	SWAT	2006	DBLP DOI BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	SWAT	2006	DBLP DOI BibTeX RDF
1	Lars Arge, Rusins Freivalds (eds.)	Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings	SWAT	2006	DBLP DOI BibTeX RDF
1	Yossi Azar, Nir Levy	Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.	SWAT	2006	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Tomasz Radzik, Qin Xin 0001	Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.	SWAT	2004	DBLP DOI BibTeX RDF
1	Torben Hagerup, Jyrki Katajainen (eds.)	Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings	SWAT	2004	DBLP DOI BibTeX RDF
1	Yossi Azar, Shai Taub	All-Norm Approximation for Scheduling on Identical Machines.	SWAT	2004	DBLP DOI BibTeX RDF
1	Giovanni Manzini	Two Space Saving Tricks for Linear Time LCP Array Computation.	SWAT	2004	DBLP DOI BibTeX RDF
1	Charles E. Leiserson	Design and Analysis of Dynamic Multithreaded Algorithms.	SWAT	2004	DBLP DOI BibTeX RDF
1	Andrew Lim 0001, Brian Rodrigues, Zhou Xu 0001	Approximation Schemes for the Crane Scheduling Problem.	SWAT	2004	DBLP DOI BibTeX RDF
1	Mikkel Thorup	Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.	SWAT	2004	DBLP DOI BibTeX RDF
1	Norbert Zeh	Connectivity of Graphs Under Edge Flips.	SWAT	2004	DBLP DOI BibTeX RDF
1	Klaus Jansen	Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.	SWAT	2004	DBLP DOI BibTeX RDF
1	Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga	Optimally Competitive List Batching.	SWAT	2004	DBLP DOI BibTeX RDF
1	Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp	Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.	SWAT	2004	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal	Cache-Oblivious Algorithms and Data Structures.	SWAT	2004	DBLP DOI BibTeX RDF
1	Amr Elmasry	Layered Heaps.	SWAT	2004	DBLP DOI BibTeX RDF
1	Michael Hoffmann 0001, Bettina Speckmann, Csaba D. Tóth	Pointed Binary Encompassing Trees.	SWAT	2004	DBLP DOI BibTeX RDF
1	Lars Arge, Laura Toma	Simplified External Memory Algorithms for Planar DAGs.	SWAT	2004	DBLP DOI BibTeX RDF
1	Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang	Construction of the Nearest Neighbor Embracing Graph of a Point Set.	SWAT	2004	DBLP DOI BibTeX RDF
1	Patchrawat Uthaisombut	The Optimal Online Algorithms for Minimizing Maximum Lateness.	SWAT	2004	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama	On Geometric Structure of Global Roundings for Graphs and Range Spaces.	SWAT	2004	DBLP DOI BibTeX RDF
1	Kazuhisa Makino, Takeaki Uno	New Algorithms for Enumerating All Maximal Cliques.	SWAT	2004	DBLP DOI BibTeX RDF
1	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding Priority Queues.	SWAT	2004	DBLP DOI BibTeX RDF
1	Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell	Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.	SWAT	2004	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Nabil H. Mustafa	Independent Set of Intersection Graphs of Convex Objects in 2D.	SWAT	2004	DBLP DOI BibTeX RDF
1	Zdenek Dvorák 0001, Jan Kára, Daniel Král, Ondrej Pangrác	An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.	SWAT	2004	DBLP DOI BibTeX RDF
1	Leah Epstein, Rob van Stee	Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.	SWAT	2004	DBLP DOI BibTeX RDF
1	Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer	Railway Delay Management: Exploring Its Algorithmic Complexity.	SWAT	2004	DBLP DOI BibTeX RDF
1	Nir Andelman, Yishay Mansour	Auctions with Budget Constraints.	SWAT	2004	DBLP DOI BibTeX RDF
1	Paz Carmi, Matthew J. Katz	Power Assignment in Radio Networks with Two Power Levels.	SWAT	2004	DBLP DOI BibTeX RDF
1	Refael Hassin, Danny Segev	Robust Subgraphs for Trees and Paths.	SWAT	2004	DBLP DOI BibTeX RDF
1	Vladlen Koltun, Carola Wenk	Matching Polyhedral Terrains Using Overlays of Envelopes.	SWAT	2004	DBLP DOI BibTeX RDF
1	Adi Avidor, Michael Langberg	The Multi-multiway Cut Problem.	SWAT	2004	DBLP DOI BibTeX RDF
1	Joan Boyar, Paul Medvedev	The Relative Worst Order Ratio Applied to Seat Reservation.	SWAT	2004	DBLP DOI BibTeX RDF
1	Jop F. Sibeyn	External Connected Components.	SWAT	2004	DBLP DOI BibTeX RDF	External Algorithms, Tree Rooting, Connected Components, List Ranking, Graph Problems
1	Andrew Lim 0001, Zhou Xu 0001	The Bottleneck Problem with Minimum Quantity Commitments.	SWAT	2004	DBLP DOI BibTeX RDF
1	Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger	Getting the Best Response for Your Erg.	SWAT	2004	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto	A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.	SWAT	2004	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Mordecai J. Golin, Yan Zhang 0021	Online Maintenance of k-Medians and k-Covers on a Line.	SWAT	2004	DBLP DOI BibTeX RDF
1	Michel Habib, Fabien de Montgolfier, Christophe Paul	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.	SWAT	2004	DBLP DOI BibTeX RDF
1	Klaus Jansen, Guochuan Zhang	Maximizing the Number of Packed Rectangles.	SWAT	2004	DBLP DOI BibTeX RDF
1	Raja Jothi, Balaji Raghavachari	Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.	SWAT	2004	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Chenyu Yan, Irina Lomonosov	Collective Tree Spanners of Graphs.	SWAT	2004	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer 0001, Norbert Zeh	Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.	SWAT	2004	DBLP DOI BibTeX RDF
1	Miroslav Chlebík, Janka Chlebíková	Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.	SWAT	2004	DBLP DOI BibTeX RDF
1	Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao	Tight Approximability Results for Test Set Problems in Bioinformatics.	SWAT	2004	DBLP DOI BibTeX RDF
1	Harold N. Gabow, Seth Pettie	The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.	SWAT	2002	DBLP DOI BibTeX RDF
1	Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger	All-Norm Approximation Algorithms.	SWAT	2002	DBLP DOI BibTeX RDF
1	Alejandro López-Ortiz, Sven Schuierer	Online Parallel Heuristics and Robot Searching under the Competitive Framework.	SWAT	2002	DBLP DOI BibTeX RDF
1	Ron Shamir, Dekel Tsur	Improved Algorithms for the Random Cluster Graph Model.	SWAT	2002	DBLP DOI BibTeX RDF
1	Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha	Approximation Algorithms for Edge-Dilation k-Center Problems.	SWAT	2002	DBLP DOI BibTeX RDF
1	Eljas Soisalon-Soininen, Peter Widmayer	Amortized Complexity of Bulk Updates in AVL-Trees.	SWAT	2002	DBLP DOI BibTeX RDF
1	Miroslav Chlebík, Janka Chlebíková	Approximation Hardness of the Steiner Tree Problem on Graphs.	SWAT	2002	DBLP DOI BibTeX RDF
1	Michael H. Albert, Mike D. Atkinson	Sorting with a Forklift.	SWAT	2002	DBLP DOI BibTeX RDF
1	Juha Kärkkäinen	Computing the Threshold for q-Gram Filters.	SWAT	2002	DBLP DOI BibTeX RDF
1	San Skulrattanakulchai	Delta-List Vertex Coloring in Linear Time.	SWAT	2002	DBLP DOI BibTeX RDF
1	Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell	Analysis of Heuristics for the Freeze-Tag Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko	Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.	SWAT	2002	DBLP DOI BibTeX RDF
1	Nissan Lev-Tov, David Peleg	Exact Algorithms and Approximation Schemes for Base Station Placement Problems.	SWAT	2002	DBLP DOI BibTeX RDF
1	John E. Augustine, Steven S. Seiden	Linear Time Approximation Schemes for Vehicle Scheduling.	SWAT	2002	DBLP DOI BibTeX RDF
1	Micha Sharir, Shakhar Smorodinsky	On Neighbors in Geometric Permutations.	SWAT	2002	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Udi Rotics	Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition.	SWAT	2002	DBLP DOI BibTeX RDF	minimum fill-in, minimal separators, graph algorithms, treewidth, Algorithms and data structures, modular decomposition
1	Anuj Puri, Stavros Tripakis	Algorithms for the Multi-constrained Routing Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe	Time and Space Efficient Multi-method Dispatching.	SWAT	2002	DBLP DOI BibTeX RDF
1	Tony W. Lai	Paging on a RAM with Limited Resources.	SWAT	2002	DBLP DOI BibTeX RDF
1	Alexander Golynski, Joseph Douglas Horton	A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.	SWAT	2002	DBLP DOI BibTeX RDF
1	R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos	Call Control with k Rejections.	SWAT	2002	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell	Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.	SWAT	2002	DBLP DOI BibTeX RDF
1	Guy Even, Guy Kortsarz, Wolfgang Slany	On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan	An Optimal Algorithm for Finding NCA on Pure Pointer Machines.	SWAT	2002	DBLP DOI BibTeX RDF
1	Itsik Pe'er, Ron Shamir, Roded Sharan	On the Generality of Phylogenies from Incomplete Directed Characters.	SWAT	2002	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin	Tree Decompositions with Small Cost.	SWAT	2002	DBLP DOI BibTeX RDF

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