Wolfgang W. Bein

According to our database1, Wolfgang W. Bein authored at least 62 papers between 1985 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Zoning Effect on the Capacity and Placement Planning for Battery Exchange Stations in Battery Consolidation Systems.
Proceedings of the 10th Annual Computing and Communication Workshop and Conference, 2020

2019
Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems.
Inf., 2019

Data Analytics and Optimization for Decision Support.
Bus. Inf. Syst. Eng., 2019

Deterministic and Stochastic Simulation: A Combined Approach to Passenger Routing in Railway Systems.
Proceedings of the Operations Research Proceedings 2019, 2019

Prediction of Crop Cultivation.
Proceedings of the IEEE 9th Annual Computing and Communication Workshop and Conference, 2019

2018
Introduction to the Minitrack on Decision Support for Complex Networks.
Proceedings of the 51st Hawaii International Conference on System Sciences, 2018

2017
Call for Papers Issue 3/2019 - Data Analytics and Optimization for Decision Support.
Bus. Inf. Syst. Eng., 2017

2015
R-LINE: A better randomized 2-server algorithm on the line.
Theor. Comput. Sci., 2015

Time-Based Estimation of Vulnerable Points in the Munich Subway Network.
Proceedings of the Operations Research Proceedings 2015, 2015

Introduction to Open Movements: FLOSS, Open Contents, Open Access, and Open Communities Minitrack.
Proceedings of the 48th Hawaii International Conference on System Sciences, 2015

Black and White Bin Packing Revisited.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
In Memoriam Peter Brucker.
J. Sched., 2014

Introduction to Open Movements Minitrack.
Proceedings of the 47th Hawaii International Conference on System Sciences, 2014

2013
Introduction to Open Movements Minitrack.
Proceedings of the 46th Hawaii International Conference on System Sciences, 2013

2011
A randomized algorithm for two servers in cross polytope spaces.
Theor. Comput. Sci., 2011

Knowledge State Algorithms.
Algorithmica, 2011

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Cloud Storage and Online Bin Packing.
Proceedings of the Intelligent Distributed Computing V - Proceedings of the 5th International Symposium on Intelligent Distributed Computing - IDC 2011, Delft, The Netherlands, 2011

2010
Efficient Data Centers, Cloud Computing in the Future of Distributed Computing.
Proceedings of the Seventh International Conference on Information Technology: New Generations, 2010

Towards an Openness Rating System for Open Source Software.
Proceedings of the 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), 2010

2009
A quadratic time 2-approximation algorithm for block sorting.
Theor. Comput. Sci., 2009

Optimally competitive list batching.
Theor. Comput. Sci., 2009

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity.
ACM Trans. Algorithms, 2009

Reliability and fault tolerance of coverage models for sensor networks.
Int. J. Sens. Networks, 2009

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
Int. J. Found. Comput. Sci., 2009

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
CoRR, 2009

Bounding the Size of k-Tuple Covers.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
A fast asymptotic approximation scheme for bin packing with rejection.
Theor. Comput. Sci., 2008

Randomized Competitive Analysis for Two Server Problems.
Algorithms, 2008

Priority Approximation for Batching.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

Clustering and the Biclique Partition Problem.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

Knowledge States: A Tool for Randomized Online Algorithms.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

A Genetic Algorithm for the Two Machine Flow Shop Problem.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007
Uniform metrical task systems with a limited number of states.
Inf. Process. Lett., 2007

Approximation for Batching via Priorities.
Sci. Ann. Comput. Sci., 2007

Knowledge State Algorithms: Randomization with Limited Information
CoRR, 2007

Equitable Revisited.
Proceedings of the Algorithms, 2007

2005
The algebraic Monge property and path problems.
Discret. Appl. Math., 2005

A Better Algorithm for Uniform Metrical Task Systems with Few States.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Fault Tolerant Coverage Model for Sensor Networks.
Proceedings of the Computational Science, 2005

A Faster and Simpler 2-Approximation Algorithm for Block Sorting.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

The Delayed <i>k</i>-Server Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Optimal embedding of honeycomb networks into hypercubes.
Parallel Process. Lett., 2004

Embedding A Complete Binary Tree Into A Three-Dimensional Grid.
J. Interconnect. Networks, 2004

Knowledge State Algorithms and the 2-Server Problem.
Electron. Notes Discret. Math., 2004

2003
Block Sorting is Hard.
Int. J. Found. Comput. Sci., 2003

A Method for Calculating Term Similarity on Large Document Collections.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

2002
The 3-server problem in the plane.
Theor. Comput. Sci., 2002

Fast Algorithms with Algebraic Monge Properties.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Fixed Layer Embeddings of Binary Trees.
Proceedings of the International Symposium on Parallel Architectures, 2002

2000
Trackless online algorithms for the server problem.
Inf. Process. Lett., 2000

Limited bookmark randomized online algorithms for the paging problem.
Inf. Process. Lett., 2000

Three-Dimensional Embedding of Binary Trees.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1995
A Monge Property for the D-dimensional Transportation Problem.
Discret. Appl. Math., 1995

1994
Surface intersection using parallelism.
Comput. Aided Geom. Des., 1994

1993
Series parallel composition of greedy linear programming problems.
Math. Program., 1993

1992
Optimal Reductions of Two-Terminal Directed Acyclic Graphs.
SIAM J. Comput., 1992

1991
A characterization of network representable polymatroids.
ZOR Methods Model. Oper. Res., 1991

1989
An<i>O</i> (<i>n</i> log<i>n</i>)-algorithm for solving a special class of linear programs.
Computing, 1989

1987
Netflows, polymatroids, and greedy structures.
PhD thesis, 1987

1986
Greedy concepts for network flow problems.
Discret. Appl. Math., 1986

1985
Minimum cost flow algorithms for series-parallel networks.
Discret. Appl. Math., 1985


  Loading...