dblp.uni-trier.dewww.uni-trier.de

Burkhard Monien Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
171EESven Grothklags, Ulf Lorenz, Burkhard Monien: From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future. Algorithmics of Large and Complex Networks 2009: 140-165
170EEDominic Dumrauf, Burkhard Monien, Karsten Tiemann: MultiProcessor Scheduling is PLS-Complete. HICSS 2009: 1-10
169EEYvonne Bleischwitz, Burkhard Monien: Fair cost-sharing methods for scheduling jobs on parallel machines. J. Discrete Algorithms 7(3): 280-290 (2009)
2008
168 Burkhard Monien, Ulf-Peter Schroeder: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings Springer 2008
167EEMarios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou: How Many Attackers Can Selfish Defenders Catch? HICSS 2008: 470
166EEHenning Meyerhenke, Burkhard Monien, Thomas Sauerwald: A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. IPDPS 2008: 1-13
165EEMarios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann: Voronoi Games on Cycle Graphs. MFCS 2008: 503-514
164EEDominic Dumrauf, Burkhard Monien: On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. WINE 2008: 94-108
163EEBurkhard Monien, Ulf Lorenz, Daniel Warner: Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?. Taschenbuch der Algorithmen 2008: 285-294
162EEMarios Mavronicolas, Burkhard Monien, Vicky Papadopoulou: How Many Attackers Can Selfish Defenders Catch? CoRR abs/0812.4206: (2008)
161EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74(7): 1199-1225 (2008)
160EEThomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: A new model for selfish routing. Theor. Comput. Sci. 406(3): 187-206 (2008)
159EEMartin Gairing, Burkhard Monien, Karsten Tiemann: Selfish Routing with Incomplete Information. Theory Comput. Syst. 42(1): 91-130 (2008)
2007
158EEBurkhard Monien, Karsten Tiemann: Routing and Scheduling with Incomplete Information. DISC 2007: 1-2
157EEMarios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann: Congestion Games with Player-Specific Constants. MFCS 2007: 633-644
156EEYvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann: The Power of Two Prices: Beyond Cross-Monotonicity. MFCS 2007: 657-668
155EEMarios Mavronicolas, Burkhard Monien, Klaus W. Wagner: Weighted Boolean Formula Games. WINE 2007: 469-481
154EEYvonne Bleischwitz, Burkhard Monien, Florian Schoppmann: To Be or Not to Be (Served). WINE 2007: 515-528
153EEMartin Gairing, Burkhard Monien, Andreas Woclaw: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2): 87-99 (2007)
2006
152EEYvonne Bleischwitz, Burkhard Monien: Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. CIAC 2006: 175-186
151EEMartin Gairing, Burkhard Monien, Karsten Tiemann: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) 2006: 501-512
150EEHenning Meyerhenke, Burkhard Monien, Stefan Schamberger: Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. IPDPS 2006
149EEBurkhard Monien: Selfish Routing in Networks. SOFSEM 2006: 61-62
148EESebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229
147EEBurkhard Monien, Andreas Woclaw: Scheduling Unrelated Parallel Machines Computational Results. WEA 2006: 195-206
146EEVladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann: Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. WINE 2006: 331-342
145EEBurkhard Monien, Robert Preis: Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4(3): 475-498 (2006)
144EERobert Elsässer, Burkhard Monien, Stefan Schamberger: Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10(1): 51-68 (2006)
143EEBurkhard Monien, Guang Gao, Horst Simon, Paul G. Spirakis, Per Stenström: Introduction. J. Parallel Distrib. Comput. 66(5): 615-616 (2006)
142EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Restricted Parallel Links. Parallel Processing Letters 16(1): 117-132 (2006)
141EEThomas Decker, Thomas Lücking, Burkhard Monien: A 5/4-approximation algorithm for scheduling identical malleable tasks. Theor. Comput. Sci. 361(2-3): 226-240 (2006)
140EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006)
2005
139EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005
138EEMartin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65
137EEMartin Gairing, Burkhard Monien, Andreas Woclaw: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839
136EEMartin Gairing, Burkhard Monien, Karsten Tiemann: Selfish routing with incomplete information. SPAA 2005: 203-212
135EERobert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209
134EEAbderezak Touzene, Khaled Day, Burkhard Monien: Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J. Parallel Distrib. Comput. 65(11): 1384-1396 (2005)
133EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343(1-2): 133-157 (2005)
2004
132EERobert Elsässer, Burkhard Monien, Stefan Schamberger: Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA 2004: 640-651
131EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657
130EERobert Elsässer, Burkhard Monien, Stefan Schamberger: Load Balancing in Dynamic Networks. ISPAN 2004: 193-200
129EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585
128EEBurkhard Monien, Stefan Schamberger: Graph Partitioning with the Party Library: Helpful-Sets in Practice. SBAC-PAD 2004: 198-205
127EEThomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: A New Model for Selfish Routing. STACS 2004: 547-558
126EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622
125EERobert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer: Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Processing Letters 14(1): 61-73 (2004)
124EEBurkhard Monien, Imrich Vrto: Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. Parallel Processing Letters 14(3-4): 361-366 (2004)
123EEUlf Lorenz, Burkhard Monien: Error analysis in minimax trees. Theor. Comput. Sci. 303(3): 485-498 (2004)
122EESergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich: New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320(2-3): 155-174 (2004)
2003
121EETorsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien: The Aircraft Sequencing Problem. Computer Science in Perspective 2003: 152-166
120EEChristian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien: SAT-Based Techniques in System Synthesis. DATE 2003: 11168-11169
119EERainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich: Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. FPL 2003: 478-487
118EERainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526
117EEMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Extreme Nash Equilibria. ICTCS 2003: 1-20
116EERainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45
115EEThomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto: Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561
114EERobert Elsässer, Burkhard Monien: Load balancing of unit size tokens and expansion properties of graphs. SPAA 2003: 266-273
113EEThomas Decker, Thomas Lücking, Burkhard Monien: A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. WAOA 2003: 95-108
112 Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-Cooperative Networks: A Survey. Bulletin of the EATCS 81: 137-164 (2003)
111EERobert Elsässer, Rastislav Kralovic, Burkhard Monien: Sparse topologies with small spectrum size. Theor. Comput. Sci. 307(3): 549-565 (2003)
110EERobert Elsässer, Thomas Lücking, Burkhard Monien: On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36(5): 461-478 (2003)
2002
109 Burkhard Monien, Rainer Feldmann: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings Springer 2002
108EERobert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger: Toward Optimal Diffusion Matrices. IPDPS 2002
107EEThomas Lücking, Burkhard Monien, Manuel Rode: On the Problem of Scheduling Flows on Distributed Networks. MFCS 2002: 495-505
106EEUlf Lorenz, Burkhard Monien: The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. STACS 2002: 203-214
105EERobert Elsässer, Burkhard Monien, Robert Preis: Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35(3): 305-320 (2002)
2001
104 Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam: High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings Springer 2001
103EEBurkhard Monien, Robert Preis: Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. MFCS 2001: 524-536
102EERobert Elsässer, Thomas Lücking, Burkhard Monien: New spectral bounds on k-partitioning of graphs. SPAA 2001: 255-262
101EERobert Elsässer, Rastislav Kralovic, Burkhard Monien: Scalable Sparse Topologies with Small Spectrum. STACS 2001: 218-229
2000
100 Rainer Feldmann, Burkhard Monien, Stefan Schamberger: A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 2000: 285-290
99EEThomas Decker, Burkhard Monien, Robert Preis: Towards Optimal Load Balancing Topologies. Euro-Par 2000: 277-287
98EERobert Elsässer, Burkhard Monien, Robert Preis: Diffusive load balancing schemes on heterogeneous networks. SPAA 2000: 30-38
97EESergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich: New Spectral Lower Bounds on the Bisection Width of Graphs. WG 2000: 23-34
96 Burkhard Monien, Robert Preis, Ralf Diekmann: Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing 26(12): 1609-1634 (2000)
1999
95EERobert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis: Optimal and Alternating-Direction Load Balancing Schemes. Euro-Par 1999: 280-290
94 Ralf Diekmann, Andreas Frommer, Burkhard Monien: Efficient schemes for nearest neighbor load balancing. Parallel Computing 25(7): 789-812 (1999)
1998
93EEAlois Knoll, Christian Altenschmidt, Joachim Biskup, Hans-Martin Blüthgen, Ingo Glöckner, Sven Hartrumpf, Hermann Helbig, Christiane Henning, Reinhard Lüling, Burkhard Monien, Thomas Noll, Norbert Sensen: An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents. ECDL 1998: 409-428
92EERalf Diekmann, Andreas Frommer, Burkhard Monien: Nearest Neighbor Load Balancing on Graphs. ESA 1998: 429-440
91 Ralf Diekmann, Derk Meyer, Burkhard Monien: Parallel Decomposition of Unstructured FEM-Meshes. Concurrency - Practice and Experience 10(1): 53-72 (1998)
90EESergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung: Embedding ladders and caterpillars into the hypercube. Discrete Applied Mathematics 83(1-3): 21-29 (1998)
89 Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distrib. Comput. 49(1): 40-56 (1998)
88EERalf Klasing, Reinhard Lüling, Burkhard Monien: Compressing cube-connected cycles and butterfly networks. Networks 32(1): 47-65 (1998)
87 Matthias Brune, Jörn Gehring, Axel Keller, Burkhard Monien, Friedhelm Ramme, Alexander Reinefeld: Specifying Resources and Services in Metacomputing Environments. Parallel Computing 24(12-13): 1751-1776 (1998)
1997
86EEBurkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel: Online Scheduling of Continuous Media Streams. Foundations of Computer Science: Potential - Theory - Cognition 1997: 313-320
85 Burkhard Monien, Jürgen Schulze: Parallel Sparse Cholesky Factorization. IRREGULAR 1997: 255-272
84 Burkhard Monien, Ralf Diekmann: A Local Graph Partitioning Heuristic Meeting Bisection Bounds. PPSC 1997
83EERainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke: A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). STACS 1997: 511-522
82 Burkhard Monien, Ralf Diekmann, Reinhard Lüling: The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). Int. J. Found. Comput. Sci. 8(3): 347-361 (1997)
1996
81 Friedhelm Meyer auf der Heide, Burkhard Monien: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings Springer 1996
80 Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann: On the Communication Throughput of Buffered Multistage Interconnection Networks. SPAA 1996: 152-161
79 Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke: Mapping tree-structured combinatorial optimization problems onto parallel computers. Solving Combinatorial Optimization Problems in Parallel 1996: 115-144
78EERalf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner: Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. Parallel Algorithms Appl. 8(1): 61-84 (1996)
1995
77 Burkhard Monien, Friedhelm Ramme, Helmut Salmen: A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. Graph Drawing 1995: 396-408
76EERalf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner: A parallel local-search algorithm for the k-partitioning problem. HICSS (2) 1995: 41-50
75EEStefan Tschöke, Reinhard Lüling, Burkhard Monien: Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. IPPS 1995: 182-189
74EECheng-Zhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau: An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. IPPS 1995: 472-479
73 Ralf Diekmann, Derk Meyer, Burkhard Monien: Parallel Decomposition of Unstructured FEM-Meshes. IRREGULAR 1995: 199-215
72EEBurkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knuth Menzel, Thomas Römke, Ulf-Peter Schroeder: Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77
71EECheng-Zhong Xu, Francis C. M. Lau, Burkhard Monien, Reinhard Lüling: Nearest-neighbor algorithms for load-balancing in parallel computers. Concurrency - Practice and Experience 7(7): 707-736 (1995)
1994
70EEBurkhard Monien, Ralf Diekmann, Reinhard Lüling: Communication Throughput of Interconnection Networks. MFCS 1994: 72-86
69EERainer Feldmann, Peter Mysliwietz, Burkhard Monien: Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA 1994: 94-103
68 Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr: Broadcasting in Butterfly and deBruijn Networks. Discrete Applied Mathematics 53(1-3): 183-197 (1994)
67 Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics 53(1-3): 55-78 (1994)
66 Burkhard Monien, Wojciech Rytter, Helmut Schäpers: Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. Theor. Comput. Sci. 123(2): 427-428 (1994)
65 Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Note on Optimal Gossiping in Some Weak-Connected Graphs. Theor. Comput. Sci. 127(2): 395-402 (1994)
1993
64 Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg: Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings Springer 1993
63EEReinhard Lüling, Burkhard Monien: A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. SPAA 1993: 164-172
62EEBurkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling: Parallel Architectures: Design and Efficient Use. STACS 1993: 247-269
61 Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. Algorithmica 10(1): 24-40 (1993)
1992
60 Burkhard Monien, Thomas Ottmann: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative Springer 1992
59 Rainer Feldmann, Peter Mysliwietz, Burkhard Monien: Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms 1992: 270-288
58 Burkhard Monien, Reinhard Lüling, Falk Langhammer: A Realizable Efficient Parallel Architecture. Heinz Nixdorf Symposium 1992: 93-109
57 Reinhard Lüling, Burkhard Monien: Load Balancing for Distributed Branch and Bound Algorithms. IPPS 1992: 543-548
56EERainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130
55EERalf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr: Broadcasting in Butterfly and DeBruijn Networks. STACS 1992: 351-362
54 Burkhard Monien, Reinhard Lüling: Mapping und Lastverteilung in parallelen Systemen. Transputer-Anwender-Treffen 1992: 1-10
1991
53 Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings Springer 1991
52EEJuraj Hromkovic, Burkhard Monien: The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220
51EEBurkhard Monien: Simulating Binary Trees on X-Trees (Extended Abstract). SPAA 1991: 147-158
50EEReinhard Lüling, Burkhard Monien, Friedhelm Ramme: Load balancing in large networks: a comparative study. SPDP 1991: 686-689
49 Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Jens Simon: Implementierung von Simulated Annealing auf Transputer-Systemen. Transputer-Anwender-Treffen 1991: 361-368
48EERalf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35
47 James Haralambides, Fillia Makedon, Burkhard Monien: Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Mathematical Systems Theory 24(3): 169-177 (1991)
46 Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter: On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. 81(2): 311-316 (1991)
1990
45EEJuraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS 1990: 337-346
44EEJames Haralambides, Fillia Makedon, Burkhard Monien: Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. SPDP 1990: 301-307
43EERalf Klasing, Reinhard Lüling, Burkhard Monien: Compressing cube-connected cycles and butterfly networks. SPDP 1990: 858-865
42EEMichal Chytil, Burkhard Monien: Caterpillars and Context-Free Languages. STACS 1990: 70-81
41EEBerthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger: An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. WDAG 1990: 90-101
1989
40 Burkhard Monien, Robert Cori: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings Springer 1989
39EEShimon Even, Burkhard Monien: On the Number of Rounds Necessary to Disseminate Information. SPAA 1989: 318-327
38EEReinhard Lüling, Burkhard Monien: Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. WDAG 1989: 160-170
37EEKnuth Menzel, Burkhard Monien: WEighted Parallel Triangulation of Simple Polygons. WG 1989: 302-315
1988
36 Burkhard Monien, Ivan Hal Sudborough: Simulating Binary Trees on Hypercubes. AWOC 1988: 170-180
35EEBurkhard Monien, Ivan Hal Sudborough: Comparing Interconnection Networks. MFCS 1988: 138-153
34EEManfred Wiegers, Burkhard Monien: Bandwidth and Profile Minimization. WG 1988: 378-393
33 Burkhard Monien, Ivan Hal Sudborough: Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. 58: 209-229 (1988)
1987
32 Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger: Superlinear Speedup for Parallel Backtracking. ICS 1987: 985-993
31 Burkhard Monien, Oliver Vornberger: Parallel Processing of Combinatorial Search. Parallel Algorithms and Architectures 1987: 60-69
1986
30 Burkhard Monien, Guy Vidal-Naquet: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings Springer 1986
29EEBurkhard Monien, Ivan Hal Sudborough: Min Cut is NP-Complete for Edge Weigthed Trees. ICALP 1986: 265-274
1985
28 Burkhard Monien: The complexity of embedding graphs into binary trees. FCT 1985: 300-309
27EEJoseph Y.-T. Leung, Burkhard Monien: On the Complexity of Deadlock Recovery. STACS 1985: 208-218
26 Burkhard Monien, Ewald Speckenmeyer: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Inf. 22(1): 115-123 (1985)
25 Burkhard Monien, Ivan Hal Sudborough: Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41: 141-167 (1985)
1984
24 Burkhard Monien: Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. Inf. Process. Lett. 18(5): 239-242 (1984)
1983
23EEBurkhard Monien, Ewald Speckenmeyer: Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP 1983: 341-349
22EEBurkhard Monien: The complexity of determining a shortest cycle of even length. Computing 31(4): 355-369 (1983)
1982
21 Burkhard Monien, Ivan Hal Sudborough: On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. 21: 237-253 (1982)
1981
20 Burkhard Monien: On the LBA Problem. FCT 1981: 265-280
19EERonald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall: On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS 1981: 216-223
18EEBurkhard Monien, Ivan Hal Sudborough: Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). MFCS 1981: 78-93
17 Burkhard Monien, Ivan Hal Sudborough: Bandwidth Constrained NP-Complete Problems STOC 1981: 207-217
1980
16EEBurkhard Monien: On a Subclass of Pseudopolynomial Problems. MFCS 1980: 414-425
15EEBurkhard Monien: Bounding the Bandwidth of NP-Complete Problems. WG 1980: 279-292
14 Burkhard Monien: Two-Way Multihead Automata Over a One-Letter Alphabet. ITA 14(1): 67-82 (1980)
1979
13EEBurkhard Monien, Ivan Hal Sudborough: On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP 1979: 431-445
1977
12EEBurkhard Monien: About the Derivation Languages of Grammars and Machines. ICALP 1977: 337-351
11 Burkhard Monien: The LBA-problem and the transormability of the class epsilon2. Theoretical Computer Science 1977: 339-350
10 Burkhard Monien: The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet Acta Inf. 8: 371-382 (1977)
9 Burkhard Monien: Corrigenda: Transformational Methods and Their Application to Complexity Problems Acta Inf. 8: 383-384 (1977)
1976
8 Burkhard Monien: Transformational Methods and their Application to Complexity Problems. Acta Inf. 6: 95-108 (1976)
7 Burkhard Monien: A Recursive and a Grammatical Characterization of the Exponential-Time Languages. Theor. Comput. Sci. 3(1): 61-74 (1976)
1975
6 Burkhard Monien: About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. Automata Theory and Formal Languages 1975: 118-126
5 Burkhard Monien: Relationships between Pushdown Automata with Counters and Complexity Classes. Mathematical Systems Theory 9(3): 248-264 (1975)
1974
4EEBurkhard Monien: Characterizations of Time-Bounded Computations by Limited Primitive Recursion. ICALP 1974: 280-293
3 Burkhard Monien: Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle. Elektronische Informationsverarbeitung und Kybernetik 10(1): 37-51 (1974)
1973
2EEBurkhard Monien: On the simulation of time bounded machines. Automatentheorie und Formale Sprachen 1973: 239-248
1972
1 Burkhard Monien: Relationship between Pushdown Automata and Tape-Bounded Turing Machines. ICALP 1972: 575-583

Coauthor Index

1Sebastian Aland [148]
2Javier Leach Albert (Javier Leach) [53]
3Christian Altenschmidt [93]
4Petra Berenbrink [86]
5Sergei L. Bezrukov [90] [97] [122]
6Joachim Biskup [93]
7Yvonne Bleischwitz [152] [154] [156] [169]
8Hans-Martin Blüthgen [93]
9Ronald V. Book [19]
10Matthias Brune [87]
11Michal Chytil [42] [46]
12Robert Cori [40]
13Maxime Crochemore [46]
14Khaled Day [134]
15Thomas Decker [99] [113] [141]
16Ralf Diekmann [49] [70] [72] [73] [76] [78] [80] [82] [84] [91] [92] [94] [96]
17Dominic Dumrauf [148] [164] [170]
18Robert Elsässer [95] [97] [98] [101] [102] [105] [108] [110] [111] [114] [122] [125] [130] [132] [135] [144]
19Shimon Even [39]
20Torsten Fahle [121]
21Rainer Feldmann [56] [59] [62] [67] [69] [72] [83] [100] [109] [112] [116] [118] [119] [120] [121]
22Andreas Frommer [92] [94] [95] [125]
23Martin Gairing [112] [116] [117] [118] [126] [129] [131] [133] [135] [136] [137] [138] [139] [140] [142] [148] [151] [153] [159] [161]
24Guang Gao [143]
25Jörn Gehring [87]
26Ingo Glöckner [93]
27Silvia Götz [121]
28Sven Grothklags [121] [171]
29James Haralambides [44] [47]
30Sven Hartrumpf [93]
31Christian Haubelt [119] [120]
32Ralf Heckmann [48] [89]
33Friedhelm Meyer auf der Heide [64] [81]
34Hermann Helbig [93]
35Christiane Henning [93]
36Juraj Hromkovic [45] [52] [56] [61] [65] [67]
37Matthias Jantzen [19]
38Claus-Dieter Jeschke [45] [61] [65]
39Axel Keller [87]
40Ralf Klasing [43] [48] [55] [62] [68] [72] [88] [89]
41Alois Knoll [93]
42Rastislav Kralovic [101] [111]
43Berthold Kröger [41]
44Falk Langhammer [58]
45Francis Chi-Moon Lau (Francis C. M. Lau) [71] [74]
46Joseph Y.-T. Leung [27]
47Ulf Lorenz [106] [123] [163] [171]
48Thomas Lücking [102] [107] [110] [112] [113] [115] [116] [117] [118] [126] [127] [129] [131] [133] [135] [138] [139] [140] [141] [142] [160] [161]
49Reinhard Lüling [38] [41] [43] [49] [50] [54] [57] [58] [62] [63] [70] [71] [72] [74] [75] [76] [78] [79] [80] [82] [86] [88] [93]
50Seshu Madhavapeddy [56] [67]
51Fillia Makedon [44] [47]
52Marios Mavronicolas [115] [117] [126] [127] [129] [131] [133] [135] [139] [140] [142] [155] [157] [160] [161] [162] [165] [167]
53Vladimir Mazalov [146]
54Knuth Menzel [37] [72]
55Derk Meyer [73] [91]
56Henning Meyerhenke [150] [166]
57Igal Milchtaich [157]
58Peter Mysliwietz [56] [59] [67] [69] [83]
59Thomas Noll [93]
60Colm Ó'Dúnlaing [19]
61Thomas Ottmann [60]
62Vicky G. Papadopoulou (Vicky Papadopoulou) [162] [165] [167]
63Regine Peine [55] [68]
64Viktor K. Prasanna (V. K. Prasanna Kumar) [104]
65Robert Preis [95] [96] [97] [98] [99] [103] [105] [122] [125] [145]
66Friedhelm Ramme [50] [77] [87]
67Ralf Rehrmann [80]
68Alexander Reinefeld [79] [87]
69Marco Riedel [86]
70Manuel Rode [107] [112] [115] [116] [118] [127] [131] [160] [161]
71Mario Rodríguez-Artalejo [53]
72Thomas Römke [72]
73Arnold L. Rosenberg [64]
74Günter Rote [108]
75Wojciech Rytter [46] [66]
76Helmut Salmen [77]
77Thomas Sauerwald [166]
78Stefan Schamberger [100] [108] [128] [130] [132] [144] [150]
79Helmut Schäpers [66]
80Florian Schoppmann [146] [148] [154] [156] [165]
81Ulf-Peter Schroeder [72] [168]
82Jürgen Schulze [85]
83Norbert Sensen [93]
84Horst Simon [143]
85Jens Simon [49]
86Ewald Speckenmeyer [23] [26] [32]
87Paul G. Spirakis [115] [117] [133] [143]
88Carsten Spräner [76] [78]
89Per Stenström [143]
90Elena Stöhr [55] [68]
91Ivan Hal Sudborough [13] [17] [18] [21] [25] [29] [33] [35] [36]
92Jürgen Teich [119] [120]
93Karsten Tiemann [136] [138] [146] [151] [156] [157] [158] [159] [170]
94Jean-Pierre Tillich [97] [122]
95Abderezak Touzene [134]
96Stefan Tschöke [75] [79] [83]
97Walter Unger [48] [89] [90]
98Sriram Vajapeyam [104]
99Guy Vidal-Naquet [30]
100Oliver Vornberger [31] [32] [41]
101Imrich Vrto [115] [124]
102Klaus W. Wagner [155]
103Daniel Warner [163]
104Gerd Wechsung [90]
105Manfred Wiegers [34]
106Andreas Woclaw [137] [147] [153]
107Celia Wrathall [19]
108Cheng-Zhong Xu [71] [74]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)