@incollection{Seidel/06,
AUTHOR = {Seidel, Raimund},
TITLE = {Top-down analysis of path compression: Deriving the inverse-Ackermann bound naturally (and easily)},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {1-1},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tarjan/06,
AUTHOR = {Tarjan, Robert E.},
TITLE = {Results and problems on self-adjusting search trees and related data structures},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {2-2},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Iwama/06,
AUTHOR = {Iwama, Kazuo},
TITLE = {Classic and quantum network coding},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {3-4},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Azar-Levy/06,
AUTHOR = {Azar, Yossi and Levy, Nir},
TITLE = {Multiplexing packets with arbitrary deadlines in bounded buffers},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {5-16},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Boyar-Favrholdt/06,
AUTHOR = {Boyar, Joan and Favrholdt, Lene M.},
TITLE = {Scheduling jobs on grid processors},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {17-28},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Epstein-Erlebach-Levin/06,
AUTHOR = {Epstein, Leah and Erlebach, Thomas and Levin, Asaf},
TITLE = {Variable sized online interval coloring with bandwidth},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {29-40},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kaplan-Nussbaum/06,
AUTHOR = {Kaplan, Haim and Nussbaum, Yahav},
TITLE = {A simpler linear-time recognition of circular-arc graphs},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {41-52},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ajwani-Friedrich-Meyer/06,
AUTHOR = {Ajwani, Deepak and Friedrich, Tobias and Meyer, Ulrich},
TITLE = {An $O(n^{2.75})$ algorithm for online topological ordering},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {53-64},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Abraham-Kavitha/06,
AUTHOR = {Abraham, David J. and Kavitha, Telikepalli},
TITLE = {Dynamic matching markets and voting paths},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {65-76},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Franceschini/06,
AUTHOR = {Franceschini, Gianni},
TITLE = {Sorting by merging or merging by sorting?},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {77-89},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kaplan-Porat-Shafrir/06,
AUTHOR = {Kaplan, Haim and Porat, Ely and Shafrir, Nira},
TITLE = {Finding the position of the $k$-mismatch and approximate tandem repeats},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {90-101},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Doerr-Friedrich-Klein-Osbild/06,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Klein, Christian and Osbild, Ralf},
TITLE = {Unbiased matrix rounding},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {102-112},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Goldwasser-Pedigo/06,
AUTHOR = {Goldwasser, Michael H. and Pedigo, Mark},
TITLE = {Online, non-preemptive scheduling of equal-length jobs on two identical machines},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {113-123},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Epstein-van_Stee-Tamir/06,
AUTHOR = {Epstein, Leah and van Stee, Rob and Tamir, Tami},
TITLE = {Paging with request sets},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {124-135},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heydenreich-Muller-Uetz/06,
AUTHOR = {Heydenreich, Birgit and M{\"u}ller, Rudolf and Uetz, Marc},
TITLE = {Decentralization and mechanism design for online machine scheduling},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {136-147},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gaspers-Kratsch-Liedloff/06,
AUTHOR = {Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu},
TITLE = {Exponential time algorithms for the minimum dominating set problem on some graph classes},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {148-159},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Razgon/06,
AUTHOR = {Razgon, Igor},
TITLE = {Exact computation of maximum induced forest},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {160-171},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dorn-Fomin-Thilikos/06,
AUTHOR = {Dorn, Frederic and Fomin, Fedor V. and Thilikos, Dimitrios M.},
TITLE = {Fast subexponential algorithm for non-local problems on graphs of bounded genus},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {172-183},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bockenhauer-Hromkovic-Kneis-Kupke/06,
AUTHOR = {B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Kneis, Joachim and Kupke, Joachim},
TITLE = {On the approximation hardness of some generalizations of TSP},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {184-195},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ausiello-Escoffier-Monnot-Paschos/06,
AUTHOR = {Ausiello, Giorgio and Escoffier, Bruno and Monnot, J{\'e}r{\^o}me and Paschos, Vangelis Th.},
TITLE = {Reoptimization of minimum and maximum Traveling Salesman's tours},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {196-207},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Angelopoulos/06,
AUTHOR = {Angelopoulos, Spyros},
TITLE = {The node-weighted Steiner problem in graphs of restricted node weights},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {208-219},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Katz-Roisman/06,
AUTHOR = {Katz, Matthew J. and Roisman, Gabriel S.},
TITLE = {On guarding rectilinear domains},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {220-231},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Knauer-Spillner/06,
AUTHOR = {Knauer, Christian and Spillner, Andreas},
TITLE = {Approximation algorithms for the minimum convex partition problem},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {232-241},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Muller-Hannemann-Schulze/06,
AUTHOR = {M{\"u}ller-Hannemann, Matthias and Schulze, Anna},
TITLE = {Approximation of octilinear Steiner trees constrained by hard and soft obstacles},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {242-254},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kammer/06,
AUTHOR = {Kammer, Frank},
TITLE = {Simultaneous embedding with two bends per edge in polynomial area},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {255-267},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ackerman-Buchin-Knauer-Rote/06,
AUTHOR = {Ackerman, Eyal and Buchin, Kevin and Knauer, Christian and Rote, G{\"u}nter},
TITLE = {Acyclic orientation of drawings},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {268-279},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ambainis-Iwama-Kawachi-Raymond-Yamashita/06,
AUTHOR = {Ambainis, Andris and Iwama, Kazuo and Kawachi, Akinori and Raymond, Rudy and Yamashita, Shigeru},
TITLE = {Improved algorithms for quantum identification of Boolean oracles},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {280-291},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arpe-Manthey/06,
AUTHOR = {Arpe, Jan and Manthey, Bodo},
TITLE = {Approximability of minimum AND-circuits},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {292-303},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Raman-Saurabh/06,
AUTHOR = {Raman, Venkatesh and Saurabh, Saket},
TITLE = {Triangles, 4-cycles and parameterized (in-)tractability},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {304-315},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{van_Leeuwen/06,
AUTHOR = {van Leeuwen, Erik},
TITLE = {Better approximation schemes for disk graphs},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {316-327},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bonifaci-Korteweg-Marchetti-Spaccamela-Stougie/06,
AUTHOR = {Bonifaci, Vincenzo and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Stougie, Leen},
TITLE = {An approximation algorithm for the wireless gathering problem},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {328-338},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dom-Guo-Niedermeier-Wernicke/06,
AUTHOR = {Dom, Michael and Guo, Jiong and Niedermeier, Rolf and Wernicke, Sebastian},
TITLE = {Minimum membership set covering and the consecutive ones property},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {339-350},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Correa-Fernandes-Wakabayashi/06,
AUTHOR = {Correa, Jos{\'e} R. and Fernandes, Cristina G. and Wakabayashi, Yoshiko},
TITLE = {Approximating rational objectives is as easy as approximating linear ones},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {351-362},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Blunck-Vahrenhold/06a,
AUTHOR = {Blunck, Henrik and Vahrenhold, Jan},
TITLE = {In-place algorithms for computing (layers of) maxima},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {363-374},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Loffler-van_Kreveld/06,
AUTHOR = {L{\"o}ffler, Maarten and van Kreveld, Marc},
TITLE = {Largest and smallest tours and convex hulls for imprecise points},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {375-387},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gudmundsson-Smid/06,
AUTHOR = {Gudmundsson, Joachim and Smid, Michiel},
TITLE = {On spanners of geometric graphs},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {388-399},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Carlson-Eppstein/06,
AUTHOR = {Carlson, Josiah and Eppstein, David},
TITLE = {The weighted maximum-mean subtree and other bicriterion subtree problems},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {400-410},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chang-Ko-Lu/06,
AUTHOR = {Chang, Maw-Shang and Ko, Ming-Tat and Lu, Hsueh-I},
TITLE = {Linear-time algorithms for tree root problems},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {411-422},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Brandstadt-Dragan-Xiang-Yan/06,
AUTHOR = {Brandst{\"a}dt, Andreas and Dragan, Feodor F. and Xiang, Yang and Yan, Chenyu},
TITLE = {Generalized powers of graphs and their algorithmic use},
BOOKTITLE = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'2006 (Riga, Latvia, July 6-8, 2006)},
SERIES = {LNCS},
VOLUME = {4059},
PAGES = {423-434},
YEAR = {2006},
EDITOR = {Arge, Lars and Freivalds, Rusins},
URL = {http://dx.doi.org/10.1007/11785293_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}