Minimum cost flow algorithms for series-parallel networks. - Wolfgang W. Bein; Peter Brucker; Arie Tamir (Discret. Appl. Math., 1985)

Greedy concepts for network flow problems. - Wolfgang W. Bein; Peter Brucker (Discret. Appl. Math., 1986)

Netflows, polymatroids, and greedy structures. - Wolfgang W. Bein (1987)

AnO (n logn)-algorithm for solving a special class of linear programs. - Wolfgang W. Bein; Peter Brucker (Computing, 1989)

A characterization of network representable polymatroids. - Wolfgang W. Bein; Peter Brucker; Matthias F. M. Stallmann (ZOR Methods Model. Oper. Res., 1991)

Optimal Reductions of Two-Terminal Directed Acyclic Graphs. - Wolfgang W. Bein; Jerzy Kamburowski; Matthias F. M. Stallmann (SIAM J. Comput., 1992)

Series parallel composition of greedy linear programming problems. - Wolfgang W. Bein; Peter Brucker; Alan J. Hoffman (Math. Program., 1993)

Surface intersection using parallelism. - Long Chyr Chang; Wolfgang W. Bein; Edward Angel (Comput. Aided Geom. Des., 1994)

A Monge Property for the D-dimensional Transportation Problem. - Wolfgang W. Bein; Peter Brucker; James K. Park; Pramod K. Pathak (Discret. Appl. Math., 1995)

Three-Dimensional Embedding of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2000)

Limited bookmark randomized online algorithms for the paging problem. - Wolfgang W. Bein; Rudolf Fleischer; Lawrence L. Larmore (Inf. Process. Lett., 2000)

Trackless online algorithms for the server problem. - Wolfgang W. Bein; Lawrence L. Larmore (Inf. Process. Lett., 2000)

Fixed Layer Embeddings of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2002)

Fast Algorithms with Algebraic Monge Properties. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (MFCS, 2002)

The 3-server problem in the plane. - Wolfgang W. Bein; Marek Chrobak; Lawrence L. Larmore (Theor. Comput. Sci., 2002)

A Method for Calculating Term Similarity on Large Document Collections. - Wolfgang W. Bein; Jeffrey S. Coombs; Kazem Taghva (ITCC, 2003)

Block Sorting is Hard. - Wolfgang W. Bein; Lawrence L. Larmore; Shahram Latifi; Ivan Hal Sudborough (Int. J. Found. Comput. Sci., 2003)

Knowledge State Algorithms and the 2-Server Problem. - Wolfgang W. Bein (Electron. Notes Discret. Math., 2004)

Embedding A Complete Binary Tree Into A Three-Dimensional Grid. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (J. Interconnect. Networks, 2004)

Optimal embedding of honeycomb networks into hypercubes. - Doina Bein; Wolfgang W. Bein; Natasa Brajkovska; Shahram Latifi (Parallel Process. Lett., 2004)

The Delayed k-Server Problem. - Wolfgang W. Bein; Kazuo Iwama; Lawrence L. Larmore; John Noga (FCT, 2005)

A Faster and Simpler 2-Approximation Algorithm for Block Sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (FCT, 2005)

Fault Tolerant Coverage Model for Sensor Networks. - Doina Bein; Wolfgang W. Bein; Srilaxmi Malladi (International Conference on Computational Science (2), 2005)

A Better Algorithm for Uniform Metrical Task Systems with Few States. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (ISPAN, 2005)

The algebraic Monge property and path problems. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (Discret. Appl. Math., 2005)

Equitable Revisited. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (ESA, 2007)

Knowledge State Algorithms: Randomization with Limited Information - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (CoRR, 2007)

Approximation for Batching via Priorities. - Wolfgang W. Bein; John Noga; Jeff Wiegley (Sci. Ann. Comput. Sci., 2007)

Uniform metrical task systems with a limited number of states. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (Inf. Process. Lett., 2007)

A Genetic Algorithm for the Two Machine Flow Shop Problem. - Kumar Adusumilli; Doina Bein; Wolfgang W. Bein (HICSS, 2008)

Knowledge States: A Tool for Randomized Online Algorithms. - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (HICSS, 2008)

Clustering and the Biclique Partition Problem. - Doina Bein; Linda Morales; Wolfgang W. Bein; Charles O. Shields Jr.; Z. Meng; Ivan Hal Sudborough (HICSS, 2008)

Priority Approximation for Batching. - Wolfgang W. Bein; John Noga; Jeff Wiegley (HICSS, 2008)

Randomized Competitive Analysis for Two Server Problems. - Wolfgang W. Bein; Kazuo Iwama; Jun Kawahara (Algorithms, 2008)

A fast asymptotic approximation scheme for bin packing with rejection. - Wolfgang W. Bein; José R. Correa; Xin Han (Theor. Comput. Sci., 2008)

Bounding the Size of k-Tuple Covers. - Wolfgang W. Bein; Shahram Latifi; Linda Morales; Ivan Hal Sudborough (HICSS, 2009)

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (CoRR, 2009)

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (Int. J. Found. Comput. Sci., 2009)

Reliability and fault tolerance of coverage models for sensor networks. - Wolfgang W. Bein; Doina Bein; Srilaxmi Malladi (Int. J. Sens. Networks, 2009)

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. - Wolfgang W. Bein; Mordecai J. Golin; Lawrence L. Larmore; Yan Zhang 021 (ACM Trans. Algorithms, 2009)

Optimally competitive list batching. - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (Theor. Comput. Sci., 2009)

A quadratic time 2-approximation algorithm for block sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (Theor. Comput. Sci., 2009)

Towards an Openness Rating System for Open Source Software. - Wolfgang W. Bein; Clinton Jeffery (HICSS, 2010)

Efficient Data Centers, Cloud Computing in the Future of Distributed Computing. - Doina Bein; Wolfgang W. Bein; Shashi Phoha (ITNG, 2010)

Cloud Storage and Online Bin Packing. - Doina Bein; Wolfgang W. Bein; Swathi Venigella (IDC, 2011)

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. - Wolfgang W. Bein; Naoki Hatta; Nelson Hernandez-Cons; Hiro Ito; Shoji Kasahara; Jun Kawahara (WAOA, 2011)

Knowledge State Algorithms. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga; Rüdiger Reischuk (Algorithmica, 2011)

A randomized algorithm for two servers in cross polytope spaces. - Wolfgang W. Bein; Kazuo Iwama; Jun Kawahara; Lawrence L. Larmore; James A. Oravec (Theor. Comput. Sci., 2011)

Introduction to Open Movements Minitrack. - Kevin Crowston; Wolfgang W. Bein; Clinton Jeffery (HICSS, 2013)

Introduction to Open Movements Minitrack. - Wolfgang W. Bein; Clinton Jeffery (HICSS, 2014)

In Memoriam Peter Brucker. - Wolfgang W. Bein; Johann L. Hurink; Sigrid Knust (J. Sched., 2014)

Black and White Bin Packing Revisited. - Jing Chen; Xin Han; Wolfgang W. Bein; Hing-Fung Ting (COCOA, 2015)

Introduction to Open Movements: FLOSS, Open Contents, Open Access, and Open Communities Minitrack. - Wolfgang W. Bein; Clinton Jeffery; Megan Squire (HICSS, 2015)

Evaluation of Online Power-Down Algorithms. - James Andro-Vasko; Wolfgang Bein; Dara Nyknahad; Hiro Ito (ITNG, 2015)

Optimizing Border Patrol Operations Using Unmanned Aerial Vehicles. - Doina Bein; Wolfgang Bein; Ashish Karki; Bharat B. Madan (ITNG, 2015)

Time-Based Estimation of Vulnerable Points in the Munich Subway Network. - Marian Sorin Nistor; Doina Bein; Wolfgang W. Bein; Matthias Dehmer; Stefan Pickl (OR, 2015)

R-LINE: A better randomized 2-server algorithm on the line. - Lucas Bang; Wolfgang W. Bein; Lawrence L. Larmore (Theor. Comput. Sci., 2015)

Call for Papers Issue 3/2019 - Data Analytics and Optimization for Decision Support. - Wolfgang W. Bein; Stefan Wolfgang Pickl; Fei Tao 001 (Bus. Inf. Syst. Eng., 2017)

Introduction to the Minitrack on Decision Support for Complex Networks. - Wolfgang W. Bein; Stefan Pickl (HICSS, 2018)

Prediction of Crop Cultivation. - Neha Rale; Raxitkumar Solanki; Doina Bein; James Andro-Vasko; Wolfgang Bein (CCWC, 2019)

Deterministic and Stochastic Simulation: A Combined Approach to Passenger Routing in Railway Systems. - Gonzalo Barbeito; Maximilian Moll; Wolfgang Bein; Stefan Pickl (OR, 2019)

Data Analytics and Optimization for Decision Support. - Wolfgang W. Bein; Stefan Pickl; Fei Tao 001 (Bus. Inf. Syst. Eng., 2019)

Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. - James Andro-Vasko; Wolfgang W. Bein; Hiro Ito (Inf., 2019)

Zoning Effect on the Capacity and Placement Planning for Battery Exchange Stations in Battery Consolidation Systems. - Dara Nyknahad; Rojin Aslani; Wolfgang W. Bein; Laxmi P. Gewali (CCWC, 2020)

Multi-Objective Grid Scheduling for Battery Exchange Stations in Battery Consolidation Systems. - Dara Nyknahad; Wolfgang Bein; Laxmi P. Gewali; Rojin Aslani (CCWC, 2021)

Evaluation of Continuous Power-Down Schemes. - James Andro-Vasko; Wolfgang Bein (Inf., 2022)

Breaking the 2-competitiveness barrier for two servers in a tree. - Wolfgang Bein; Lawrence L. Larmore (Theor. Comput. Sci., 2023)

Introduction to the Minitrack on Intelligent Decision Support on Networks - Data-driven Optimization, Augmented and Explainable AI in Complex Supply Chains. - Stefan Pickl; Alexander B. Bordetsky; Wolfgang Bein (HICSS, 2024)