Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Erlebach
Person information
- affiliation: University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Thomas Erlebach, Nils Morawietz
, Jakob T. Spooner, Petra Wolf:
A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. 144: 103534 (2024)- [c112]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP 2024: 55:1-55:18 - [c111]Thomas Erlebach:
Exploration and Rendezvous in Temporal Graphs (Invited Talk). SAND 2024: 1:1-1:1 - [c110]Thomas Erlebach, Nils Morawietz, Petra Wolf:
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND 2024: 12:1-12:16 - [i23]Thomas Erlebach, Kleitos Papadopoulos:
A faster algorithm for the construction of optimal factoring automata. CoRR abs/2404.02354 (2024) - [i22]Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang:
Scheduling with Obligatory Tests. CoRR abs/2406.16734 (2024) - [i21]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR abs/2407.10170 (2024) - 2023
- [j56]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica 85(2): 406-443 (2023) - [j55]Thomas Erlebach, Jakob T. Spooner:
Parameterised temporal exploration problems. J. Comput. Syst. Sci. 135: 73-88 (2023) - [c109]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) 2023: 168-181 - [c108]Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI 2023: 5577-5585 - [i20]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR abs/2305.09245 (2023) - [i19]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. CoRR abs/2305.10108 (2023) - [i18]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR abs/2312.07140 (2023) - 2022
- [j54]Thomas Erlebach, Jakob T. Spooner:
Exploration of k-edge-deficient temporal graphs. Acta Informatica 59(4): 387-407 (2022) - [j53]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. 313: 53-66 (2022) - [c107]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA 2022: 49:1-49:18 - [c106]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. ISAAC 2022: 49:1-49:16 - [c105]Thomas Erlebach, Jakob T. Spooner:
Parameterized Temporal Exploration Problems. SAND 2022: 15:1-15:17 - [e11]Thomas Erlebach, Michael Segal:
Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13707, Springer 2022, ISBN 978-3-031-22049-4 [contents] - [i17]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR abs/2206.15201 (2022) - [i16]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. CoRR abs/2209.12314 (2022) - [i15]Thomas Erlebach, Jakob T. Spooner:
Parameterized temporal exploration problems. CoRR abs/2212.01594 (2022) - 2021
- [j52]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. 115: 246-263 (2021) - [j51]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On temporal graph exploration. J. Comput. Syst. Sci. 119: 1-18 (2021) - [j50]Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky:
"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. 860: 117-134 (2021) - [c104]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA 2021: 10:1-10:18 - [c103]Thomas Erlebach:
Algorithms that Access the Input via Queries. SOFSEM 2021: 3-12 - [c102]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS 2021: 27:1-27:18 - [c101]Thomas Erlebach, Jakob T. Spooner:
Exploration of k-Edge-Deficient Temporal Graphs. WADS 2021: 371-384 - [i14]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR abs/2101.05032 (2021) - [i13]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR abs/2107.00572 (2021) - 2020
- [j49]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020) - [j48]Leah Epstein, Thomas Erlebach:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 569-570 (2020) - [j47]Leah Epstein, Thomas Erlebach:
Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 571 (2020) - [c100]Thomas Erlebach, Jakob T. Spooner:
Non-strict Temporal Exploration. SIROCCO 2020: 129-145 - [c99]Thomas Erlebach, Jakob T. Spooner:
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. SOFSEM 2020: 64-75 - [i12]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Untrusted Predictions Improve Trustable Query Policies. CoRR abs/2011.07385 (2020)
2010 – 2019
- 2019
- [j46]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788: 66-78 (2019) - [c98]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. FCT 2019: 171-184 - [c97]Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner:
Two Moves per Time Step Make a Difference. ICALP 2019: 141:1-141:14 - [c96]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. STACS 2019: 51:1-51:14 - [i11]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. CoRR abs/1904.09142 (2019) - [i10]Thomas Erlebach, Jakob T. Spooner:
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. CoRR abs/1908.06828 (2019) - 2018
- [c95]Thomas Erlebach:
Computing and Scheduling with Explorable Uncertainty. CiE 2018: 156-160 - [c94]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. COCOON 2018: 242-254 - [c93]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. ITCS 2018: 30:1-30:14 - [c92]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC 2018: 45:1-45:12 - [c91]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ISAAC 2018: 64:1-64:13 - [c90]Thomas Erlebach, Jakob T. Spooner:
Faster Exploration of Degree-Bounded Temporal Graphs. MFCS 2018: 36:1-36:13 - [c89]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing between Two Locations: Online Scheduling with Two Servers. MFCS 2018: 50:1-50:14 - [e10]Leah Epstein, Thomas Erlebach:
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11312, Springer 2018, ISBN 978-3-030-04692-7 [contents] - [i9]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR abs/1807.01962 (2018) - 2017
- [j45]Aram Rasul, Thomas Erlebach:
The extra-bit technique for reducing idle listening in data collection. Int. J. Sens. Networks 25(1): 31-44 (2017) - [c88]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) 2017: 317-332 - [c87]Aeshah Alsughayyir, Thomas Erlebach:
Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. COCOA (2) 2017: 457-465 - [c86]Aisha Mousa Mashraqi, Thomas Erlebach:
Throughput Improvement by Reducing Dropped Packets at Interface Queue (IFQ) in Multi-channel Wireless Mesh Networks. ISPAN-FCST-ISCC 2017: 140-147 - [c85]Aeshah Alsughayyir, Thomas Erlebach:
A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems. ISPDC 2017: 44-53 - [i8]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. CoRR abs/1709.02592 (2017) - 2016
- [j44]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613: 51-64 (2016) - [c84]Thomas Erlebach:
Algorithms for Queryable Uncertainty. FAW 2016: 1-7 - [c83]Aeshah Alsughayyir, Thomas Erlebach:
Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems. PDP 2016: 617-621 - 2015
- [j43]Thomas Erlebach, Michael Hoffmann:
Query-Competitive Algorithms for Computing with Uncertainty. Bull. EATCS 116 (2015) - [j42]Thomas Erlebach, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 135-136 (2015) - [j41]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600: 143-154 (2015) - [c82]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. ICALP (1) 2015: 444-455 - [c81]Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. IWOCA 2015: 13-24 - [c80]Aram Rasul, Thomas Erlebach:
An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks. MASS 2015: 55-63 - [c79]Thomas Erlebach, Matthew Radoja:
Further Results on Capacitated Network Design Games. SAGT 2015: 57-68 - [i7]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. CoRR abs/1504.07976 (2015) - 2014
- [j40]Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen:
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553: 1 (2014) - [j39]S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington:
An experimental study of small multi-hop wireless networks using chirp spread spectrum. Wirel. Networks 20(1): 89-103 (2014) - [c78]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) 2014: 263-274 - [c77]Aram Rasul, Thomas Erlebach:
Reducing Idle Listening during Data Collection in Wireless Sensor Networks. MSN 2014: 16-23 - [c76]Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. SOFSEM 2014: 65-76 - [c75]Thomas Erlebach, Michael Hoffmann:
Minimum Spanning Tree Verification Under Uncertainty. WG 2014: 164-175 - 2013
- [c74]Shagufta Henna, Thomas Erlebach:
Approximating Maximum Disjoint Coverage in Wireless Sensor Networks. ADHOC-NOW 2013: 148-159 - [c73]Shagufta Henna, Thomas Erlebach:
Least Channel Variation Multi-channel MAC (LCV-MMAC). ADHOC-NOW 2013: 160-171 - [c72]Hasna Mohsen Alqahtani, Thomas Erlebach:
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost. CIAC 2013: 1-12 - [e9]Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7846, Springer 2013, ISBN 978-3-642-38015-0 [contents] - 2012
- [c71]S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington:
A simple scheme to improve the throughput of small multi-hop wireless networks. CSNDSP 2012: 1-5 - [c70]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - [e8]Thomas Erlebach, Sotiris E. Nikoletseas, Pekka Orponen:
Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7111, Springer 2012, ISBN 978-3-642-28208-9 [contents] - [i6]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. CoRR abs/1205.4564 (2012) - 2011
- [j38]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. 1(3): 213-225 (2011) - [j37]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms 7(4): 47:1-47:14 (2011) - [c69]Jawad Ashraf, Thomas Erlebach:
A hybrid scheduling technique for grid workflows in advance reservation environments. HPCS 2011: 98-106 - [c68]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196 - [p4]Thomas Erlebach:
Majority - Who Gets Elected Class Rep? Algorithms Unplugged 2011: 239-247 - 2010
- [j36]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) - [j35]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella:
Length-bounded cuts and flows. ACM Trans. Algorithms 7(1): 4:1-4:27 (2010) - [j34]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010) - [c67]Thomas Erlebach, Tom Grant:
Scheduling Multicast Transmissions under SINR Constraints. ALGOSENSORS 2010: 47-61 - [c66]Thomas Erlebach, Erik Jan van Leeuwen:
PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM 2010: 166-177 - [c65]Thomas Erlebach, Marco E. Lübbecke:
Frontmatter, Table of Contents, Preface, Organization. ATMOS 2010 - [c64]Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini:
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 - [c63]Jawad Ashraf, Thomas Erlebach:
A new resource mapping technique for Grid workflows in advance reservation environments. HPCS 2010: 63-70 - [c62]Ambreen Shahnaz, Thomas Erlebach:
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. IWCMC 2010: 529-533 - [c61]Shagufta Henna, Thomas Erlebach:
CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks. MoMM 2010: 94-101 - [e7]Thomas Erlebach, Marco E. Lübbecke:
ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010. OASIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2010 [contents]
2000 – 2009
- 2009
- [j33]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009) - [j32]Yossi Azar, Thomas Erlebach:
Foreword. Algorithmica 53(4): 455-456 (2009) - [j31]Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic:
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res. 57(4): 1006-1025 (2009) - [j30]Thomas Erlebach, Christos Kaklamanis:
WAOA 2006 Special Issue of TOCS. Theory Comput. Syst. 45(3): 427-428 (2009) - [j29]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. SIAM J. Discret. Math. 23(2): 822-841 (2009) - [c60]Thomas Erlebach, Anna Mereu:
Path Splicing with Guaranteed Fault Tolerance. GLOBECOM 2009: 1-6 - [c59]Thomas Erlebach, Ambreen Shahnaz:
Approximating node-weighted multicast trees in wireless ad-hoc networks. IWCMC 2009: 639-643 - [c58]Thomas Erlebach, Matús Mihalák:
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA 2009: 135-146 - [r1]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725 - 2008
- [j28]Thomas Erlebach, Stamatis Stefanakos:
Routing to reduce the cost of wavelength conversion. Discret. Appl. Math. 156(15): 2911-2923 (2008) - [j27]Thomas Erlebach, Giuseppe Persiano:
WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. 43(1): 1-2 (2008) - [c57]Thomas Erlebach, Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs. LATIN 2008: 747-758 - [c56]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 - [c55]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: algorithms and complexity. SODA 2008: 473-482 - [c54]Thomas Erlebach, Erik Jan van Leeuwen:
Approximating geometric coverage problems. SODA 2008: 1267-1276 - [c53]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - [c52]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - [p3]Thomas Erlebach:
Mehrheitsbestimmung - Wer wird Klassensprecher?. Taschenbuch der Algorithmen 2008: 245-254 - [e6]Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma:
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, ISBN 978-3-540-92247-6 [contents] - [i5]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) - [i4]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008) - 2007
- [j26]Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. Algorithmica 47(3): 217-238 (2007) - [j25]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - [j24]