Publication | Date of Publication | Type |
---|
Truthful Matching with Online Items and Offline Agents | 2024-04-24 | Paper |
Bilateral Trade: A Regret Minimization Perspective | 2024-03-05 | Paper |
Pandora’s Box Problem with Order Constraints | 2024-02-23 | Paper |
Average case analysis of fully dynamic connectivity for directed graphs | 2024-01-05 | Paper |
Flow time scheduling with uncertain processing time | 2023-11-14 | Paper |
Efficient two-sided markets with limited information | 2023-11-14 | Paper |
Competitive algorithms for the on-line traveling salesman | 2022-12-16 | Paper |
Serving requests with on-line routing | 2022-12-09 | Paper |
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint | 2022-08-02 | Paper |
Stochastic graph exploration | 2022-07-21 | Paper |
Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness | 2022-07-06 | Paper |
Heat transfer increase by convection in liquid-infused surfaces for laminar and turbulent flows | 2022-04-29 | Paper |
Algorithms for fair \(k\)-clustering with multiple protected attributes | 2021-12-13 | Paper |
Budget feasible mechanisms on matroids | 2021-04-19 | Paper |
Efficient computation of the Weighted Clustering Coefficient | 2021-03-26 | Paper |
Heat transfer in a turbulent channel flow with super-hydrophobic or liquid-infused walls | 2021-01-19 | Paper |
Prior-free multi-unit auctions with ordered bidders | 2020-11-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111366 | 2020-05-27 | Paper |
(1 + ∊)-Approximate Incremental Matching in Constant Deterministic Amortized Time | 2019-10-15 | Paper |
A Mazing 2+∊ Approximation for Unsplittable Flow on a Path | 2019-06-20 | Paper |
Comparison between super-hydrophobic, liquid infused and rough surfaces: a direct numerical simulation study | 2019-05-28 | Paper |
A Mazing 2+ε Approximation for Unsplittable Flow on a Path | 2019-03-28 | Paper |
Designing cost-sharing methods for Bayesian games | 2019-03-21 | Paper |
Fixed Price Approximability of the Optimal Gain from Trade | 2019-01-30 | Paper |
On-line resource management with applications to routing and scheduling | 2019-01-10 | Paper |
Approximately Efficient Double Auctions with Strong Budget Balance | 2018-07-16 | Paper |
On-line routing in all-optical networks | 2018-07-04 | Paper |
The role of vorticity in the turbulent/thermal transport of a channel flow with local blowing | 2018-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4598285 | 2017-12-19 | Paper |
On-line competitive algorithms for call admission in optical networks | 2017-12-05 | Paper |
Budget feasible mechanisms on matroids | 2017-08-31 | Paper |
Robust Hierarchical k-Center Clustering | 2017-05-19 | Paper |
Bidding Strategies for Fantasy-Sports Auctions | 2017-02-10 | Paper |
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets | 2017-02-10 | Paper |
Online network design with outliers | 2016-11-01 | Paper |
Designing Cost-Sharing Methods for Bayesian Games | 2016-09-29 | Paper |
Minimizing the flow time without migration | 2016-09-29 | Paper |
Heat transfer in a turbulent channel flow with square bars or circular rods on one wall | 2016-03-29 | Paper |
Sequential Posted Price Mechanisms with Correlated Valuations | 2016-01-08 | Paper |
Efficient Computation of the Weighted Clustering Coefficient | 2015-09-09 | Paper |
Sharing the cost more efficiently | 2015-09-02 | Paper |
Efficient cost-sharing mechanisms for prize-collecting problems | 2015-08-31 | Paper |
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines | 2015-02-27 | Paper |
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets | 2015-01-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2934710 | 2014-12-18 | Paper |
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree | 2014-11-25 | Paper |
Utilitarian Mechanism Design for Multiobjective Optimization | 2014-11-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921719 | 2014-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5417649 | 2014-05-22 | Paper |
Prior-free auctions with ordered bidders | 2014-05-13 | Paper |
Network formation games with local coalitions | 2014-03-13 | Paper |
Set Covering with Our Eyes Closed | 2013-09-25 | Paper |
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path | 2013-03-19 | Paper |
On Multiple Keyword Sponsored Search Auctions with Budgets | 2012-11-01 | Paper |
Game-theoretic analysis of Internet switching with selfish users | 2012-10-11 | Paper |
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees | 2012-09-25 | Paper |
Approximation Algorithms for Union and Intersection Covering Problems | 2012-08-31 | Paper |
Strict Cost Sharing Schemes for Steiner Forest | 2011-04-04 | Paper |
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines | 2011-02-01 | Paper |
Steady and time-periodic blowing/suction perturbations in a turbulent channel flow | 2011-01-21 | Paper |
Online Network Design with Outliers | 2010-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579386 | 2010-08-06 | Paper |
Channel flow over large cube roughness: a direct numerical simulation study | 2010-06-30 | Paper |
Direct numerical simulation of turbulent channel flow with wall velocity disturbances | 2010-04-22 | Paper |
Properties of d- and k-type roughness in a turbulent channel flow | 2010-03-18 | Paper |
Numerical assessment of local forcing on the heat transfer in a turbulent channel flow | 2010-03-18 | Paper |
Algorithms - ESA 2003 | 2010-03-03 | Paper |
Algorithms and Experiments for the Webgraph | 2009-01-19 | Paper |
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game | 2008-10-28 | Paper |
Direct numerical simulation of three-dimensional turbulent rough channels: parameterization and flow physics | 2008-10-24 | Paper |
Pricing Tree Access Networks with Connected Backbones | 2008-09-25 | Paper |
Estimating Clustering Indexes in Data Streams | 2008-09-25 | Paper |
Cut Problems in Graphs with a Budget Constraint | 2008-09-18 | Paper |
Passive scalar statistics in a turbulent channel with local time-periodic blowing/suction at walls | 2008-09-05 | Paper |
Stability and Similarity of Link Analysis Ranking Algorithms | 2008-08-19 | Paper |
Comparison between experiments and direct numerical simulations in a channel flow with roughness on one wall | 2008-06-17 | Paper |
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm | 2008-05-27 | Paper |
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines | 2008-03-14 | Paper |
Cut problems in graphs with a budget constraint | 2007-10-30 | Paper |
On the Value of Preemption in Scheduling | 2007-08-28 | Paper |
Approximating total flow time on parallel machines | 2007-08-23 | Paper |
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing | 2007-05-03 | Paper |
Design of trees in the hose model: the balanced case | 2007-02-19 | Paper |
Guidelines for modeling a 2D rough wall channel flow | 2007-01-24 | Paper |
Online weighted flow time and deadline scheduling | 2006-10-31 | Paper |
Turbulent channel flow with either transverse or longitudinal roughness elements on one wall | 2006-09-25 | Paper |
Minimizing stall time in single and parallel disk systems | 2006-09-12 | Paper |
Passive scalar in a turbulent channel flow with wall velocity disturbances | 2006-01-31 | Paper |
Efficient token-based control in rings. | 2006-01-17 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Cross-monotonic cost sharing methods for connected facility location games | 2005-01-11 | Paper |
Semi-clairvoyant scheduling | 2004-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4818855 | 2004-09-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472463 | 2004-08-04 | Paper |
Direct numerical simulations of turbulent channel flow with transverse square bars on one wall | 2004-06-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4542564 | 2004-01-27 | Paper |
Scheduling multicasts on unit-capacity trees and meshes. | 2003-08-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4707788 | 2003-06-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4780781 | 2002-11-21 | Paper |
Minimizing the Flow Time Without Migration | 2002-09-29 | Paper |
Algorithms for the on-line travelling salesman | 2002-02-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4503935 | 2001-11-28 | Paper |
On-line Randomized Call Control Revisited | 2001-06-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4526975 | 2001-02-28 | Paper |
Multiprocessor Scheduling with Rejection | 2000-03-19 | Paper |
On-line routing in all-optical networks | 2000-01-12 | Paper |
On capital investment. | 2000-01-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250198 | 1999-07-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4252318 | 1999-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4228508 | 1999-03-01 | Paper |
Enclosing a Set of Objects by Two Minimum Area Rectangles | 1997-06-22 | Paper |
Average case analysis of fully dynamic reachability for directed graphs | 1997-05-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4875173 | 1996-09-15 | Paper |