Beat Gfeller Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller: Faster Swap Edge Computation in Minimum Diameter Spanning Trees. Algorithmica 62(1-2): 169-191 (2012)
2011
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Remco M. Dijkman, Beat Gfeller, Jochen Malte Küster, Hagen Völzer: Identifying refactoring opportunities in process model repositories. Information & Software Technology 53(9): 937-948 (2011)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders: Towards optimal range medians. Theor. Comput. Sci. 412(24): 2588-2601 (2011)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Nicola Santoro, Peter Widmayer: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Sec. Comput. 8(1): 1-12 (2011)
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Hagen Völzer, Gunnar Wilmsmann: Faster Or-Join Enactment for BPMN 2.0. BPMN 2011: 31-43
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller: Finding Longest Approximate Periodic Patterns. WADS 2011: 463-474
2010
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Shantanu Das, Beat Gfeller, Peter Widmayer: Computing All Best Swaps for Minimum-Stretch Tree Spanners. J. Graph Algorithms Appl. 14(2): 287-306 (2010)
2009
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer: Single machine batch scheduling with release times. J. Comb. Optim. 17(3): 323-338 (2009)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Peter Sanders: Towards Optimal Range Medians. ICALP (1) 2009: 475-486
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Peter Sanders: Towards Optimal Range Medians. CoRR abs/0901.1761 (2009)
2008
j1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Elias Vicari: A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs. Ad Hoc & Sensor Wireless Networks 6(3-4): 197-213 (2008)
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller: Faster Swap Edge Computation in Minimum Diameter Spanning Trees. ESA 2008: 454-465
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Shantanu Das, Beat Gfeller, Peter Widmayer: Computing Best Swaps in Optimal Tree Spanners. ISAAC 2008: 716-727
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Angle Optimization in Target Tracking. SWAT 2008: 65-76
2007
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Elias Vicari: A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs. ADHOC-NOW 2007: 59-73
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Elias Vicari: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. PODC 2007: 53-60
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Nicola Santoro, Peter Widmayer: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree. DISC 2007: 268-282
2006
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer: Online Single Machine Batch Scheduling. MFCS 2006: 424-435

Coauthor Index

1Gerth Stølting Brodal
[j5]
2Shantanu Das 0001
[j3] [c7]
3Remco M. Dijkman
[j6]
4Allan Grønlund Jørgensen
[j5]
5Jochen Malte Küster
[j6]
6Matús Mihalák
[c6] [c4]
7Leon Peeters
[j2] [c1]
8Peter Sanders
[j5] [c9] [i1]
9Nicola Santoro
[j4] [c2]
10Subhash Suri
[c6] [c4]
11Elias Vicari
[j1] [c6] [c5] [c4] [c3]
12Hagen Völzer
[j6] [c11]
13Birgitta Weber
[j2] [c1]
14Peter Widmayer
[j4] [j3] [j2] [c7] [c6] [c4] [c2] [c1]
15Gunnar Wilmsmann
[c11]

Colors in the list of coauthors

Last update Thu May 23 02:13:43 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page