Wolfgang W. Bein

ORCID

Publication Activity (10 Years)

Years Active: 1985-2020
Publications (10 Years): 6

Top Venues

University of Osnabrück, Germany (PHD)

Education History

University of Osnabrück, Germany

PHD

Publications

Dara Nyknahad, Rojin Aslani, Wolfgang W. Bein, Laxmi P. Gewali
Zoning Effect on the Capacity and Placement Planning for Battery Exchange Stations in Battery Consolidation Systems. CCWC (2020)
Wolfgang W. Bein, Stefan Pickl
Introduction to the Minitrack on Decision Support for Complex Networks. HICSS (2019)
Wolfgang W. Bein, Stefan Pickl, Fei Tao
Data Analytics and Optimization for Decision Support. Bus. Inf. Syst. Eng. 61 (3) (2019)
James Andro-Vasko, Wolfgang W. Bein, Hiro Ito
Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. Inf. 10 (2) (2019)
Wolfgang W. Bein, Stefan Pickl
Introduction to the Minitrack on Decision Support for Complex Networks. HICSS (2018)
Wolfgang W. Bein, Stefan Wolfgang Pickl, Fei Tao
Call for Papers Issue 3/2019 - Data Analytics and Optimization for Decision Support. Bus. Inf. Syst. Eng. 59 (6) (2017)
Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting
Black and White Bin Packing Revisited. COCOA (2015)
Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
R-LINE: A better randomized 2-server algorithm on the line. Theor. Comput. Sci. 605 (2015)
Wolfgang W. Bein, Clinton Jeffery, Megan Squire
Introduction to Open Movements: FLOSS, Open Contents, Open Access, and Open Communities Minitrack. HICSS (2015)
Marian Sorin Nistor, Doina Bein, Wolfgang W. Bein, Matthias Dehmer, Stefan Pickl
Time-Based Estimation of Vulnerable Points in the Munich Subway Network. OR (2015)
Wolfgang W. Bein, Johann L. Hurink, Sigrid Knust
In Memoriam Peter Brucker. J. Sched. 17 (1) (2014)
Wolfgang W. Bein, Clinton Jeffery
Introduction to Open Movements Minitrack. HICSS (2014)
Kevin Crowston, Wolfgang W. Bein, Clinton Jeffery
Introduction to Open Movements Minitrack. HICSS (2013)
Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA (2012)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
Knowledge State Algorithms. Algorithmica 60 (3) (2011)
Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA (2011)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412 (7) (2011)
Doina Bein, Wolfgang W. Bein, Swathi Venigella
Cloud Storage and Online Bin Packing. IDC (2011)
Doina Bein, Wolfgang W. Bein, Shashi Phoha
Efficient Data Centers, Cloud Computing in the Future of Distributed Computing. ITNG (2010)
Wolfgang W. Bein, Clinton Jeffery
Towards an Openness Rating System for Open Source Software. HICSS (2010)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR (2009)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410 (8-10) (2009)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20 (1) (2009)
Wolfgang W. Bein, Doina Bein, Srilaxmi Malladi
Reliability and fault tolerance of coverage models for sensor networks. Int. J. Sens. Networks 5 (4) (2009)
Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms 6 (1) (2009)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally competitive list batching. Theor. Comput. Sci. 410 (38-40) (2009)
Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough
Bounding the Size of k-Tuple Covers. HICSS (2009)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
Randomized Competitive Analysis for Two-Server Problems. ESA (2008)
Wolfgang W. Bein, José R. Correa, Xin Han
A fast asymptotic approximation scheme for bin packing with rejection. Theor. Comput. Sci. 393 (1-3) (2008)
Wolfgang W. Bein, John Noga, Jeff Wiegley
Priority Approximation for Batching. HICSS (2008)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
Randomized Competitive Analysis for Two Server Problems. Algorithms 1 (1) (2008)
Kumar Adusumilli, Doina Bein, Wolfgang W. Bein
A Genetic Algorithm for the Two Machine Flow Shop Problem. HICSS (2008)
Doina Bein, Linda Morales, Wolfgang W. Bein, Charles O. Shields Jr., Z. Meng, Ivan Hal Sudborough
Clustering and the Biclique Partition Problem. HICSS (2008)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States: A Tool for Randomized Online Algorithms. HICSS (2008)
Wolfgang W. Bein, José R. Correa, Xin Han
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. ESCAPE (2007)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA (2007)
Wolfgang W. Bein, John Noga, Jeff Wiegley
Approximation for Batching via Priorities. Sci. Ann. Comput. Sci. 17 (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104 (4) (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Equitable Revisited. ESA (2007)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge State Algorithms: Randomization with Limited Information CoRR (2007)
Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA (2006)
Doina Bein, Wolfgang W. Bein, Srilaxmi Malladi
Fault Tolerant Coverage Model for Sensor Networks. International Conference on Computational Science (2) (2005)
Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
The algebraic Monge property and path problems. Discret. Appl. Math. 145 (3) (2005)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN (2005)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT (2005)
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
-Server Problem. FCT (2005)
Wolfgang W. Bein
Knowledge State Algorithms and the 2-Server Problem. Electron. Notes Discret. Math. 17 (2004)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks 5 (2) (2004)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally Competitive List Batching. SWAT (2004)
Wolfgang W. Bein
Knowledge State Algorithms and the 2-Server Problem. CTW (2004)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN (2004)
Doina Bein, Wolfgang W. Bein, Natasa Brajkovska, Shahram Latifi
Optimal embedding of honeycomb networks into hypercubes. Parallel Process. Lett. 14 (3-4) (2004)
Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14 (3) (2003)
Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva
A Method for Calculating Term Similarity on Large Document Collections. ITCC (2003)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Fixed Layer Embeddings of Binary Trees. ISPAN (2002)
Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
Fast Algorithms with Algebraic Monge Properties. MFCS (2002)
Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
Block Sorting is Hard. ISPAN (2002)
Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
The 3-server problem in the plane. Theor. Comput. Sci. 289 (1) (2002)
Wolfgang W. Bein, Lawrence L. Larmore
Trackless online algorithms for the server problem. Inf. Process. Lett. 74 (1-2) (2000)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Three-Dimensional Embedding of Binary Trees. ISPAN (2000)
Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76 (4-6) (2000)
Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
The 3-Server Problem in the Plane. ESA (1999)
Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
A Monge Property for the D-dimensional Transportation Problem. Discret. Appl. Math. 58 (2) (1995)
Long Chyr Chang, Wolfgang W. Bein, Edward Angel
Surface intersection using parallelism. Comput. Aided Geom. Des. 11 (1) (1994)
Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
Series parallel composition of greedy linear programming problems. Math. Program. 62 (1993)
Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21 (6) (1992)
Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann
A characterization of network representable polymatroids. ZOR Methods Model. Oper. Res. 35 (4) (1991)
Wolfgang W. Bein, Peter Brucker
)-algorithm for solving a special class of linear programs. Computing 42 (4) (1989)
Wolfgang W. Bein, Peter Brucker
Greedy concepts for network flow problems. Discret. Appl. Math. 15 (2-3) (1986)
Wolfgang W. Bein, Peter Brucker, Arie Tamir
Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. 10 (2) (1985)

Wolfgang W. Bein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Wolfgang W. Bein