@article{Bast-Mehlhorn-Schafer-Tamaki/06,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
TITLE = {Matching algorithms are fast in sparse random graphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {3-14},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1254-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kirsten/06,
AUTHOR = {Kirsten, Daniel},
TITLE = {A Burnside approach to the finite substitution problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {15-50},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1255-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tholey/06,
AUTHOR = {Tholey, Torsten},
TITLE = {Solving the 2-disjoint paths problem in nearly linear time},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {51-78},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1256-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hansen/06,
AUTHOR = {Hansen, Kristoffer Arnsfelt},
TITLE = {Constant width planar computation characterizes ACC$^0$},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {79-92},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1258-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dhamdhere-Gupta-Ravi/06,
AUTHOR = {Dhamdhere, Kedar and Gupta, Anupam and Ravi, R.},
TITLE = {Approximation algorithms for minimizing average distortion},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {93-111},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1259-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hagerup/06,
AUTHOR = {Hagerup, Torben},
TITLE = {Simpler computation of single-source shortest paths in linear average time},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {113-120},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1260-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Souza-Steger/06,
AUTHOR = {Souza, Alexander and Steger, Angelika},
TITLE = {The expected competitive ratio for weighted completion time scheduling},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {121-136},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1261-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bala/06,
AUTHOR = {Bala, Sebastian},
TITLE = {Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {137-163},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1262-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ambainis-Beaudry-Golovkins-Kikusts-Mercer-Therien/06,
AUTHOR = {Ambainis, Andris and Beaudry, Martin and Golovkins, Marats and {\c{K}}ikusts, Arnolds and Mercer, Mark and Th{\'e}rien, Denis},
TITLE = {Algebraic results on quantum automata},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {165-188},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1263-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Chakaravarthy-van_Melkebeek/06,
AUTHOR = {Cai, Jin-Yi and Chakaravarthy, Venkatesan T. and van Melkebeek, Dieter},
TITLE = {Time-space tradeoff in derandomizing probabilistic logspace},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {189-208},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1264-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bertoni-Choffrut-Goldwurm-Lonati/06,
AUTHOR = {Bertoni, Alberto and Choffrut, Christian and Goldwurm, Massimiliano and Lonati, Violetta},
TITLE = {Local limit properties for pattern statistics and rational models},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {209-235},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1265-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Muscholl-Schwentick-Segoufin/06,
AUTHOR = {Muscholl, Anca and Schwentick, Thomas and Segoufin, Luc},
TITLE = {Active context-free games},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {1},
PAGES = {237-276},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1278-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hitchcock-Lutz/06,
AUTHOR = {Hitchcock, John M. and Lutz, Jack H.},
TITLE = {Why computational complexity requires stricter martingales},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {277-296},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1135-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ailloud-Durand/06,
AUTHOR = {Ailloud, {\'E}tienne and Durand, Arnaud},
TITLE = {The expressive power of bijections over weakly arithmetized structures},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {297-309},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1165-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Song-Yang-Perkowski-Wang/06,
AUTHOR = {Song, Xiaoyu and Yang, Guowu and Perkowski, Marek and Wang, Yuke},
TITLE = {Algebraic characterization of reversible logic gates},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {311-319},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1166-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Franceschini-Grossi/06,
AUTHOR = {Franceschini, Gianni and Grossi, Roberto},
TITLE = {Optimal implicit dictionaries over unbounded universes},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {321-345},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1167-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Loding/06,
AUTHOR = {L{\"o}ding, Christof},
TITLE = {Reachability problems on regular ground tree rewriting graphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {347-383},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1170-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zheng-Rettinger/06,
AUTHOR = {Zheng, Xizhong and Rettinger, Robert},
TITLE = {A Reference Correction of ''Effective Jordan decomposition''},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {2},
PAGES = {385-385},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1323-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {Originally in Theory of Computing Systems, Vol. 38, 2005, No. 2, 189-209},
}
@article{Bender-Farach-Colton-Mosteiro/06,
AUTHOR = {Bender, Michael A. and Farach-Colton, Martin and Mosteiro, Miguel A.},
TITLE = {Insertion sort is $O(n \log n)$},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {391-397},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1237-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goyal-Lodha-Muthukrishnan/06,
AUTHOR = {Goyal, Navin and Lodha, Sachin and Muthukrishnan, S.},
TITLE = {The Graham-Knowlton problem revisited},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {399-412},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1242-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ruskey-Weston/06,
AUTHOR = {Ruskey, Frank and Weston, Mark},
TITLE = {More fun with symmetric Venn diagrams},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {413-423},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1243-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cardinal-Kremer-Langerman/06,
AUTHOR = {Cardinal, Jean and Kremer, Steve and Langerman, Stefan},
TITLE = {Juggling with pattern matching},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {425-437},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1239-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Demaine-Langerman-Langerman/06,
AUTHOR = {Demaine, Erik D. and Demaine, Martin L. and Langerman, Arthur and Langerman, Stefan},
TITLE = {Morpion solitaire},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {439-453},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1240-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bocker/06,
AUTHOR = {B{\"o}cker, Sebastian},
TITLE = {Sequencing from compomers: The puzzle},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {455-471},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1238-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Demaine/06,
AUTHOR = {Demaine, Erik D. and Demaine, Martin L.},
TITLE = {Puzzles, art, and magic with algorithms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {3},
PAGES = {473-481},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1241-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bernasconi-Ciriani-Luccio-Pagli/06,
AUTHOR = {Bernasconi, Anna and Ciriani, Valentina and Luccio, Fabrizio and Pagli, Linda},
TITLE = {Exploiting regularities for Boolean function synthesis},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {4},
PAGES = {485-501},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1171-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bottoni-Labella-Manca-Mitrana/06,
AUTHOR = {Bottoni, Paolo and Labella, Anna and Manca, Vincenzo and Mitrana, Victor},
TITLE = {Superposition based on Watson-Crick-like complementarity},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {4},
PAGES = {503-524},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1175-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Droste-Jansen-Wegener/06,
AUTHOR = {Droste, Stefan and Jansen, Thomas and Wegener, Ingo},
TITLE = {Upper and lower bounds for randomized search heuristics in black-box optimization},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {4},
PAGES = {525-544},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1177-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gramm-Guo-Niedermeier/06,
AUTHOR = {Gramm, Jens and Guo, Jiong and Niedermeier, Rolf},
TITLE = {Parameterized intractability of distinguishing substring selection},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {4},
PAGES = {545-560},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1185-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandstadt-Engelfriet-Le-Lozin/06,
AUTHOR = {Brandst{\"a}dt, Andreas and Engelfriet, Joost and Le, Ho{\`a}ng-Oanh and Lozin, Vadim V.},
TITLE = {Clique-width for 4-vertex forbidden subgraphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {4},
PAGES = {561-590},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1199-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Caragiannis-Kaklamanis-Kanellopoulos/06a,
AUTHOR = {Caragiannis, Ioannis and Kaklamanis, Christos and Kanellopoulos, Panagiotis},
TITLE = {Energy-efficient wireless network design},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {593-617},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1204-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Daley-McQuillan/06,
AUTHOR = {Daley, Mark and McQuillan, Ian},
TITLE = {Useful templates and iterated template-guided DNA recombination in ciliates},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {619-633},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1206-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Riege-Rothe/06,
AUTHOR = {Riege, Tobias and Rothe, J{\"o}rg},
TITLE = {Complexity of the exact domatic number problem and of the exact conveyor flow shop problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {635-668},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1209-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hemaspaandra-Ogihara-Zaki-Zimand/06,
AUTHOR = {Hemaspaandra, Lane A. and Ogihara, Mitsunori and Zaki, Mohammed J. and Zimand, Marius},
TITLE = {The complexity of finding top-Toda-equivalence-class members},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {669-684},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1211-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Merkle-Reimann/06,
AUTHOR = {Merkle, Wolfgang and Reimann, Jan},
TITLE = {Selection functions that do not preserve normality},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {685-697},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1253-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Straubing-Therien/06,
AUTHOR = {Straubing, Howard and Th{\'e}rien, Denis},
TITLE = {A note on MOD$_p$ --- MOD$m$ circuits},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {699-706},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-004-1210-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Merkle-Mihailovic-Slaman/06,
AUTHOR = {Merkle, Wolfgang and Mihailovi{\'c}, Nenad and Slaman, Theodore A.},
TITLE = {Some results on effective randomness},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {707-721},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1212-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yamamoto/06,
AUTHOR = {Yamamoto, Masaki},
TITLE = {Generating instances for MAX2SAT with optimal solutions},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {723-742},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1221-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Litow/06,
AUTHOR = {Litow, B.},
TITLE = {A special case of a unary regular language containment},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {743-751},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1230-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gault-Stewart/06,
AUTHOR = {Gault, Richard L. and Stewart, Iain A.},
TITLE = {An infinite hierarchy in a class of polynomial-time program schemes},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {5},
PAGES = {753-783},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-005-1230-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karger-Ruhl/06,
AUTHOR = {Karger, David R. and Ruhl, Matthias},
TITLE = {Simple efficient load-balancing algorithms for peer-to-peer systems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {787-804},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1246-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rosen-Tsirkin/06,
AUTHOR = {Ros{\'e}n, Adi and Tsirkin, Michael S.},
TITLE = {On delivery times in packet networks under adversarial traffic},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {805-827},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1248-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chung-Graham-Mao-Varghese/06,
AUTHOR = {Chung, Fan and Graham, Ronald and Mao, Jia and Varghese, George},
TITLE = {Parallelism versus memory allocation in pipelined router forwarding engines},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {829-849},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1249-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Li-Plaxton-Tiwari-Venkataramani/06,
AUTHOR = {Li, Xiaozhou and Plaxton, C. Greg and Tiwari, Mitul and Venkataramani, Arun},
TITLE = {Online hierarchical cooperative caching},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {851-874},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1250-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Herlihy-Kuhn-Tirthapura-Wattenhofer/06,
AUTHOR = {Herlihy, Maurice and Kuhn, Fabian and Tirthapura, Srikanta and Wattenhofer, Roger},
TITLE = {Dynamic analysis of the arrow distributed protocol},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {875-901},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1251-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bagchi-Bhargava-Chaudhary-Eppstein-Scheideler/06,
AUTHOR = {Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian},
TITLE = {The effect of faults on network expansion},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {903-928},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1349-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Andreev-Racke/06,
AUTHOR = {Andreev, Konstantin and R{\"a}cke, Harald},
TITLE = {Balanced graph partitioning},
JOURNAL = {Theory of Computing Systems},
VOLUME = {39},
NUMBER = {6},
PAGES = {929-939},
YEAR = {2006},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1350-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}