| Publication | Date of Publication | Type |
|---|
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Graph realization of distance sets
Theoretical Computer Science | 2024-11-06 | Paper |
| Graph realization of distance sets | 2024-08-06 | Paper |
| On the role of the high-low partition in realizing a degree sequence by a bipartite graph | 2024-08-06 | Paper |
| On realizing a single degree sequence by a bipartite graph | 2024-05-27 | Paper |
| scientific article; zbMATH DE number 7788600 (Why is no real title available?) | 2024-01-15 | Paper |
Degree realization by bipartite multigraphs
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Weighted microscopic image reconstruction
Discrete Applied Mathematics | 2024-01-09 | Paper |
scientific article; zbMATH DE number 7759278 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Graph realizations: maximum degree in vertex neighborhoods
Discrete Mathematics | 2023-06-12 | Paper |
Forcibly bipartite and acyclic (uni-)graphic sequences
Discrete Mathematics | 2023-05-15 | Paper |
| On vertex-weighted graph realizations | 2023-03-22 | Paper |
Composed degree-distance realizations of graphs
Algorithmica | 2023-03-09 | Paper |
| scientific article; zbMATH DE number 7651149 (Why is no real title available?) | 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
Discrete Applied Mathematics | 2022-09-15 | Paper |
| Vertex-weighted graphs: realizable and unrealizable domains | 2022-07-13 | Paper |
On vertex-weighted realizations of acyclic and general graphs
Theoretical Computer Science | 2022-06-13 | Paper |
| Weighted microscopic image reconstruction | 2022-03-24 | Paper |
| Relaxed and approximate graph realizations | 2022-03-22 | Paper |
Composed degree-distance realizations of graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
``Green barrier coverage with mobile sensors
Theoretical Computer Science | 2021-03-09 | Paper |
Efficiently realizing interval sequences
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Nearly optimal perfectly periodic schedules
Distributed Computing | 2020-12-03 | Paper |
Decision-driven scheduling
Real-Time Systems | 2020-07-13 | Paper |
Vertex-weighted realizations of graphs
Theoretical Computer Science | 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: from offline to online
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The minimum color sum of bipartite graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
Improved approximation algorithms for weighted 2-path partitions
Discrete Applied Mathematics | 2018-03-21 | Paper |
Set it and forget it: approximating the set once strip cover problem
Algorithmica | 2017-10-10 | Paper |
Fast deflection routing for packets and worms
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Maximizing Barrier Coverage Lifetime with Mobile Sensors
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Tight Approximation Bounds for the Seminar Assignment Problem
Approximation and Online Algorithms | 2017-04-04 | Paper |
Approximating the throughput of multiple machines under real-time scheduling
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Competitive dynamic bandwidth allocation
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Changing of the guards: strip cover with duty cycling
Theoretical Computer Science | 2015-12-10 | Paper |
Improved approximation algorithms for weighted 2-path partitions
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A unified approach to approximating resource allocation and scheduling
Journal of the ACM | 2015-10-30 | Paper |
``Green barrier coverage with mobile sensors
Lecture Notes in Computer Science | 2015-09-21 | Paper |
| Windows scheduling as a restricted version of bin packing | 2015-08-03 | Paper |
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Average case network lifetime on an interval with adjustable sensing ranges
Algorithmica | 2015-05-21 | Paper |
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
A unified approach to approximating resource allocation and scheduling
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Establishing wireless conference calls under delay constraints
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
A general buffer scheme for the windows scheduling problem
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Windows scheduling of arbitrary-length jobs on multiple machines
Journal of Scheduling | 2014-02-05 | Paper |
Maximizing barrier coverage lifetime with mobile sensors
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A competitive rate allocation game
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering | 2013-07-24 | Paper |
Paging mobile users in cellular networks: optimality versus complexity and simplicity
Theoretical Computer Science | 2013-02-19 | Paper |
Online maximum directed cut
Journal of Combinatorial Optimization | 2012-10-01 | Paper |
Changing of the guards: strip cover with duty cycling
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Ordered coloring of grids and related graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
| Optimizing Information Credibility in Social Swarming Applications | 2010-09-29 | Paper |
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Ordered coloring grids and related graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Online Maximum Directed Cut
Algorithms and Computation | 2009-12-17 | Paper |
Online dynamic programming speedups
Theory of Computing Systems | 2009-09-02 | Paper |
Scheduling techniques for media-on-demand
Algorithmica | 2009-05-13 | Paper |
Peak Shaving through Resource Buffering
Approximation and Online Algorithms | 2009-02-12 | Paper |
Finding Mobile Data: Efficiency vs. Location Inaccuracy
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Optimal delay for media-on-demand with pre-loading and pre-buffering
Theoretical Computer Science | 2008-06-24 | Paper |
Online Dynamic Programming Speedups
Approximation and Online Algorithms | 2008-02-21 | Paper |
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Online Conflict-Free Colorings for Hypergraphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research | 2005-11-11 | Paper |
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119735 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119707 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119694 (Why is no real title available?) | 2004-11-29 | Paper |
Efficient algorithms for periodic scheduling
Computer Networks | 2004-11-18 | Paper |
Establishing wireless conference calls under delay constraints
Journal of Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079413 (Why is no real title available?) | 2004-07-28 | Paper |
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms | 2004-03-14 | Paper |
Windows Scheduling Problems for Broadcast Systems
SIAM Journal on Computing | 2003-09-28 | Paper |
Competitive on-Line switching policies
Algorithmica | 2003-08-17 | Paper |
Sharing video on demand
Discrete Applied Mathematics | 2003-07-30 | Paper |
New algorithms for related machines with temporary jobs.
Journal of Scheduling | 2003-07-27 | Paper |
A matched approximation bound for the sum of a greedy coloring
Information Processing Letters | 2002-07-25 | Paper |
| Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract) | 2002-06-23 | Paper |
Approximating the throughput of multiple machines in real-time scheduling
SIAM Journal on Computing | 2002-04-23 | Paper |
On-line load balancing in a hierarchical server topology
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1263238 (Why is no real title available?) | 2002-02-03 | Paper |
Sum Multicoloring of Graphs
Journal of Algorithms | 2000-12-19 | Paper |
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing | 2000-10-18 | Paper |
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing | 2000-06-05 | Paper |
Minimum Color Sum of Bipartite Graphs
Journal of Algorithms | 2000-05-18 | Paper |
Optimal multiple message broadcasting in telephone-like communication systems
Discrete Applied Mathematics | 2000-01-30 | Paper |
Bandwidth Allocation with Preemption
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1303536 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1256696 (Why is no real title available?) | 1999-04-22 | Paper |
On chromatic sums and distributed resource allocation
Information and Computation | 1998-09-27 | Paper |
Guaranteeing Fair Service to Persistent Dependent Tasks
SIAM Journal on Computing | 1998-09-20 | Paper |
| Multiple message broadcasting in the postal model | 1998-02-19 | Paper |
Sharing memory robustly in message-passing systems
Journal of the ACM | 1998-02-02 | Paper |
Efficient routing in optical networks
Journal of the ACM | 1998-01-22 | Paper |
| scientific article; zbMATH DE number 1775430 (Why is no real title available?) | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 1003273 (Why is no real title available?) | 1997-06-02 | Paper |
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
Journal of Algorithms | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910880 (Why is no real title available?) | 1996-10-13 | Paper |
Optimal computation of census functions in the postal model
Discrete Applied Mathematics | 1996-02-26 | Paper |
Optimal amortized distributed consensus
Information and Computation | 1995-10-29 | Paper |
Broadcasting multiple messages in simultaneous send/receive systems
Discrete Applied Mathematics | 1995-06-30 | Paper |
Designing broadcasting algorithms in the postal model for message-passing systems
Mathematical Systems Theory | 1995-05-14 | Paper |
Tracking mobile users in wireless communications networks
IEEE Transactions on Information Theory | 1994-10-26 | Paper |
| scientific article; zbMATH DE number 432827 (Why is no real title available?) | 1993-10-20 | Paper |
The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters | 1993-05-16 | Paper |
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
Mathematical Systems Theory | 1993-04-01 | Paper |
A Linear Time Approach to the Set Maxima Problem
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Information and Computation | 1992-06-28 | Paper |
Single round simulation on radio networks
Journal of Algorithms | 1992-06-28 | Paper |
Fault-tolerant critical section management in asynchronous environments
Information and Computation | 1992-06-28 | Paper |
A lower bound for radio broadcast
Journal of Computer and System Sciences | 1992-06-25 | Paper |
Consensus algorithms with one-bit messages
Distributed Computing | 1991-01-01 | Paper |
Renaming in an asynchronous environment
Journal of the ACM | 1990-01-01 | Paper |
Improved routing strategies with succinct tables
Journal of Algorithms | 1990-01-01 | Paper |
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Bounds on Universal Sequences
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4119974 (Why is no real title available?) | 1989-01-01 | Paper |
