Wolfgang W. Bein

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