| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147528 | 2024-01-15 | Paper |
| Degree realization by bipartite multigraphs | 2024-01-11 | Paper |
| Weighted microscopic image reconstruction | 2024-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059166 | 2023-11-02 | Paper |
| Graph realizations: maximum degree in vertex neighborhoods | 2023-06-12 | Paper |
| Forcibly bipartite and acyclic (uni-)graphic sequences | 2023-05-15 | Paper |
| On vertex-weighted graph realizations | 2023-03-22 | Paper |
| Composed degree-distance realizations of graphs | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874474 | 2023-02-07 | Paper |
| The Generalized Microscopic Image Reconstruction Problem | 2023-02-03 | Paper |
| Efficiently Realizing Interval Sequences | 2023-02-03 | Paper |
| A fair-cost analysis of the random neighbor sampling method | 2022-10-25 | Paper |
| The generalized microscopic image reconstruction problem | 2022-09-15 | Paper |
| Vertex-weighted graphs: realizable and unrealizable domains | 2022-07-13 | Paper |
| On vertex-weighted realizations of acyclic and general graphs | 2022-06-13 | Paper |
| Weighted microscopic image reconstruction | 2022-03-24 | Paper |
| Composed degree-distance realizations of graphs | 2022-03-22 | Paper |
| Relaxed and approximate graph realizations | 2022-03-22 | Paper |
| ``Green barrier coverage with mobile sensors | 2021-03-09 | Paper |
| Efficiently Realizing Interval Sequences | 2020-12-04 | Paper |
| Nearly optimal perfectly periodic schedules | 2020-12-03 | Paper |
| Decision-driven scheduling | 2020-07-13 | Paper |
| Vertex-weighted realizations of graphs | 2020-01-22 | Paper |
| Graph profile realizations and applications to social networks | 2019-10-15 | Paper |
| Realizability of graph specifications: characterizations and algorithms | 2019-01-30 | Paper |
| Deterministic conflict-free coloring for intervals | 2018-11-05 | Paper |
| Throughput maximization of real-time scheduling with batching | 2018-11-05 | Paper |
| The minimum color sum of bipartite graphs | 2018-07-04 | Paper |
| Improved approximation algorithms for weighted 2-path partitions | 2018-03-21 | Paper |
| Set it and forget it: approximating the set once strip cover problem | 2017-10-10 | Paper |
| Fast deflection routing for packets and worms | 2017-09-29 | Paper |
| Maximizing Barrier Coverage Lifetime with Mobile Sensors | 2017-05-24 | Paper |
| Tight Approximation Bounds for the Seminar Assignment Problem | 2017-04-04 | Paper |
| Approximating the throughput of multiple machines under real-time scheduling | 2016-09-29 | Paper |
| Nearly optimal perfectly-periodic schedules | 2016-03-04 | Paper |
| Competitive dynamic bandwidth allocation | 2016-03-02 | Paper |
| Changing of the guards: strip cover with duty cycling | 2015-12-10 | Paper |
| Improved Approximation Algorithms for Weighted 2-Path Partitions | 2015-11-19 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2015-10-30 | Paper |
| “Green” Barrier Coverage with Mobile Sensors | 2015-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501263 | 2015-08-03 | Paper |
| Competitive on-line paging strategies for mobile users under delay constraints | 2015-08-03 | Paper |
| Average case network lifetime on an interval with adjustable sensing ranges | 2015-05-21 | Paper |
| Finding mobile data under delay constraints with searching costs | 2015-03-02 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2014-09-26 | Paper |
| Establishing wireless conference calls under delay constraints | 2014-07-25 | Paper |
| A general buffer scheme for the windows scheduling problem | 2014-04-01 | Paper |
| Windows scheduling of arbitrary-length jobs on multiple machines | 2014-02-05 | Paper |
| Maximizing Barrier Coverage Lifetime with Mobile Sensors | 2013-09-17 | Paper |
| A Competitive Rate Allocation Game | 2013-07-24 | Paper |
| Paging mobile users in cellular networks: optimality versus complexity and simplicity | 2013-02-19 | Paper |
| Online maximum directed cut | 2012-10-01 | Paper |
| Changing of the Guards: Strip Cover with Duty Cycling | 2012-09-26 | Paper |
| Ordered coloring of grids and related graphs | 2012-08-10 | Paper |
| Online Conflict-Free Colouring for Hypergraphs | 2010-10-14 | Paper |
| Optimizing Information Credibility in Social Swarming Applications | 2010-09-29 | Paper |
| Windows scheduling as a restricted version of bin packing | 2010-08-14 | Paper |
| Ordered Coloring Grids and Related Graphs | 2010-02-24 | Paper |
| Online Maximum Directed Cut | 2009-12-17 | Paper |
| Online dynamic programming speedups | 2009-09-02 | Paper |
| Scheduling techniques for media-on-demand | 2009-05-13 | Paper |
| Peak Shaving through Resource Buffering | 2009-02-12 | Paper |
| Finding Mobile Data: Efficiency vs. Location Inaccuracy | 2008-09-25 | Paper |
| Optimal delay for media-on-demand with pre-loading and pre-buffering | 2008-06-24 | Paper |
| Online Dynamic Programming Speedups | 2008-02-21 | Paper |
| Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging | 2008-01-11 | Paper |
| Online Conflict-Free Colorings for Hypergraphs | 2007-11-28 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Minimizing Service and Operation Costs of Periodic Scheduling | 2005-11-11 | Paper |
| Efficient Algorithms for Optimal Stream Merging for Media-on-Demand | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828965 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828978 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829010 | 2004-11-29 | Paper |
| Efficient algorithms for periodic scheduling | 2004-11-18 | Paper |
| Establishing wireless conference calls under delay constraints | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471373 | 2004-07-28 | Paper |
| Competitive on-line stream merging algorithms for media-on-demand | 2004-03-14 | Paper |
| Windows Scheduling Problems for Broadcast Systems | 2003-09-28 | Paper |
| Competitive on-Line switching policies | 2003-08-17 | Paper |
| Sharing video on demand | 2003-07-30 | Paper |
| New algorithms for related machines with temporary jobs. | 2003-07-27 | Paper |
| A matched approximation bound for the sum of a greedy coloring | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768321 | 2002-06-23 | Paper |
| Approximating the Throughput of Multiple Machines in Real-Time Scheduling | 2002-04-23 | Paper |
| On-Line Load Balancing in a Hierarchical Server Topology | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234111 | 2002-02-03 | Paper |
| Sum Multicoloring of Graphs | 2000-12-19 | Paper |
| Message Multicasting in Heterogeneous Networks | 2000-10-18 | Paper |
| Optimal broadcasting of two files over an asymmetric channel | 2000-06-05 | Paper |
| Minimum Color Sum of Bipartite Graphs | 2000-05-18 | Paper |
| Optimal multiple message broadcasting in telephone-like communication systems | 2000-01-30 | Paper |
| Bandwidth Allocation with Preemption | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250158 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228432 | 1999-04-22 | Paper |
| On chromatic sums and distributed resource allocation | 1998-09-27 | Paper |
| Guaranteeing Fair Service to Persistent Dependent Tasks | 1998-09-20 | Paper |
| Multiple message broadcasting in the postal model | 1998-02-19 | Paper |
| Sharing memory robustly in message-passing systems | 1998-02-02 | Paper |
| Efficient routing in optical networks | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542563 | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128902 | 1997-06-02 | Paper |
| Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886054 | 1996-10-13 | Paper |
| Optimal computation of census functions in the postal model | 1996-02-26 | Paper |
| Optimal amortized distributed consensus | 1995-10-29 | Paper |
| Broadcasting multiple messages in simultaneous send/receive systems | 1995-06-30 | Paper |
| Designing broadcasting algorithms in the postal model for message-passing systems | 1995-05-14 | Paper |
| Tracking mobile users in wireless communications networks | 1994-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138961 | 1993-10-20 | Paper |
| The greedy algorithm is optimal for on-line edge coloring | 1993-05-16 | Paper |
| A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment | 1993-04-01 | Paper |
| Fault-tolerant critical section management in asynchronous environments | 1992-06-28 | Paper |
| Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement | 1992-06-28 | Paper |
| A Linear Time Approach to the Set Maxima Problem | 1992-06-28 | Paper |
| Single round simulation on radio networks | 1992-06-28 | Paper |
| A lower bound for radio broadcast | 1992-06-25 | Paper |
| Consensus algorithms with one-bit messages | 1991-01-01 | Paper |
| Improved routing strategies with succinct tables | 1990-01-01 | Paper |
| Renaming in an asynchronous environment | 1990-01-01 | Paper |
| Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments | 1990-01-01 | Paper |
| Bounds on Universal Sequences | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733694 | 1989-01-01 | Paper |
