| Publication | Date of Publication | Type |
|---|
| Overcoming Congestion in Distributed Coloring | 2024-03-26 | Paper |
| Distributed coloring of hypergraphs | 2024-01-11 | Paper |
| Near-optimal distributed degree+1 coloring | 2023-12-08 | Paper |
| Efficient randomized distributed coloring in CONGEST | 2023-11-14 | Paper |
| Superfast coloring in CONGEST via efficient color sampling | 2023-02-13 | Paper |
| Improved approximations of independent sets in bounded-degree graphs | 2022-12-09 | Paper |
| Facility dispersion and remote subgraphs | 2022-12-09 | Paper |
| Approximations for the general block distribution of a matrix | 2022-12-09 | Paper |
| Approximating maximum independent sets by excluding subgraphs | 2022-12-09 | Paper |
| Query minimization under stochastic uncertainty | 2022-10-13 | Paper |
| Distributed Testing of Distance-k Colorings | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092365 | 2022-07-21 | Paper |
| Generalized disk graphs | 2022-03-25 | Paper |
| Tight bounds on subexponential time approximation of set cover and related problems | 2022-03-22 | Paper |
| Superfast coloring in CONGEST via efficient color sampling | 2022-03-22 | Paper |
| Posimodular function optimization | 2022-03-22 | Paper |
| Wireless network algorithmics | 2022-02-16 | Paper |
| Sparse Backbone and Optimal Distributed SINR Algorithms | 2022-02-16 | Paper |
| Network design under general wireless interference | 2021-11-19 | Paper |
| Query minimization under stochastic uncertainty | 2021-11-18 | Paper |
| Computing inductive vertex orderings | 2021-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002848 | 2021-07-28 | Paper |
| Query-competitive sorting with uncertainty | 2021-04-15 | Paper |
| Effective Wireless Scheduling via Hypergraph Sketches | 2021-04-14 | Paper |
| Local improvement algorithms for a path packing problem: a performance analysis based on linear programming | 2021-04-07 | Paper |
| Distance-2 Coloring in the CONGEST Model | 2021-03-15 | Paper |
| Plain SINR is Enough! | 2021-01-20 | Paper |
| Distributed Minimum Degree Spanning Trees | 2021-01-20 | Paper |
| Simple and local independent set approximation | 2020-11-06 | Paper |
| Radio aggregation scheduling | 2020-09-17 | Paper |
| Limitations of current wireless link scheduling algorithms | 2020-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111461 | 2020-05-27 | Paper |
| Leader election in SINR model with arbitrary power control | 2020-02-13 | Paper |
| Improved distributed algorithms for coloring interval graphs with application to multicoloring trees | 2020-02-13 | Paper |
| Leveraging Indirect Signaling for Topology Inference and Fast Broadcast | 2019-09-19 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| Leveraging multiple channels in ad hoc networks | 2019-06-20 | Paper |
| The Power of Non-Uniform Wireless Power | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743417 | 2019-05-10 | Paper |
| Distributed approximation of \(k\)-service assignment | 2019-03-21 | Paper |
| Simple and local independent set approximation | 2019-01-30 | Paper |
| Approximating k-set cover and complementary graph coloring | 2019-01-11 | Paper |
| Space-Constrained Interval Selection | 2018-11-05 | Paper |
| Improved bounds for scheduling conflicting jobs with minsum criteria | 2018-11-05 | Paper |
| Distributed large independent sets in one round on bounded-independence graphs | 2018-08-24 | Paper |
| Leader election in SINR model with arbitrary power control | 2018-04-12 | Paper |
| Improved distributed algorithms for coloring interval graphs with application to multicoloring trees | 2018-04-12 | Paper |
| Distributed backup placement in networks | 2018-04-11 | Paper |
| Computing large independent sets in a single round | 2018-02-23 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363802 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365137 | 2017-09-29 | Paper |
| Posimodular function optimization | 2017-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275394 | 2017-07-13 | Paper |
| The Power of Oblivious Wireless Power | 2017-06-28 | Paper |
| The minimum vulnerability problem on specific graph classes | 2016-11-29 | Paper |
| Max point-tolerance graphs | 2016-11-24 | Paper |
| Streaming algorithms for independent sets in sparse hypergraphs | 2016-10-21 | Paper |
| Greed is good | 2016-09-01 | Paper |
| Shrinking maxima, decreasing costs: new online packing and covering problems | 2016-05-31 | Paper |
| Nearly optimal bounds for distributed wireless scheduling in the SINR model | 2016-05-23 | Paper |
| Leveraging multiple channels in ad hoc networks | 2016-03-23 | Paper |
| A Local Broadcast Layer for the SINR Network Model | 2016-03-23 | Paper |
| Semi-transitive orientations and word-representable graphs | 2016-02-04 | Paper |
| On the complexity of the shortest-path broadcast problem | 2015-12-10 | Paper |
| The Minimum Vulnerability Problem on Graphs | 2015-09-11 | Paper |
| Beyond geometry | 2015-09-03 | Paper |
| Improved results for data migration and open shop scheduling | 2015-09-02 | Paper |
| How Well Can Graphs Represent Wireless Interference? | 2015-08-21 | Paper |
| On the Impact of Identifiers on Local Decision | 2015-08-05 | Paper |
| On Colorings of Squares of Outerplanar Graphs | 2015-08-03 | Paper |
| On spectrum sharing games | 2015-08-03 | Paper |
| Vertex coloring edge-weighted digraphs | 2015-06-15 | Paper |
| MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS | 2015-04-29 | Paper |
| Connectivity and aggregation in multihop wireless networks | 2015-03-02 | Paper |
| Online set packing and competitive scheduling of multi-part tasks | 2015-03-02 | Paper |
| Progress (and Lack Thereof) for Graph Coloring Approximation Problems | 2015-02-20 | Paper |
| Distributed Algorithms for Coloring Interval Graphs | 2015-02-10 | Paper |
| Wireless scheduling with power control | 2014-12-05 | Paper |
| Distributed connectivity of wireless networks | 2014-12-05 | Paper |
| Corrigendum | 2014-12-05 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Approximating the domatic number | 2014-09-26 | Paper |
| Wireless capacity with arbitrary gain matrix | 2014-09-18 | Paper |
| Sum edge coloring of multigraphs via configuration LP | 2014-09-09 | Paper |
| Online selection of intervals and \(t\)-intervals | 2014-01-10 | Paper |
| Online scheduling with interval conflicts | 2013-10-21 | Paper |
| Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems | 2013-10-04 | Paper |
| Space-Constrained Interval Selection | 2013-08-12 | Paper |
| Streaming and Communication Complexity of Clique Approximation | 2013-08-12 | Paper |
| On spectrum sharing games | 2013-06-28 | Paper |
| SDP-based algorithms for maximum independent set problems on hypergraphs | 2013-02-19 | Paper |
| Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees | 2013-02-19 | Paper |
| Online Set Packing | 2012-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113712 | 2012-01-23 | Paper |
| Online coloring of hypergraphs | 2012-01-18 | Paper |
| Alternation Graphs | 2011-12-16 | Paper |
| Nearly optimal bounds for distributed wireless scheduling in the SINR model | 2011-07-07 | Paper |
| Vertex coloring the square of outerplanar graphs of low degree | 2011-05-09 | Paper |
| Randomized Approximation of the Stable Marriage Problem | 2011-03-18 | Paper |
| Streaming Algorithms for Independent Sets | 2010-09-07 | Paper |
| Graphs Capturing Alternations in Words | 2010-08-31 | Paper |
| Improved approximation results for the stable marriage problem | 2010-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579461 | 2010-08-06 | Paper |
| Online Selection of Intervals and t-Intervals | 2010-06-22 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth | 2009-12-04 | Paper |
| Wireless Scheduling with Power Control | 2009-10-29 | Paper |
| Weighted sum coloring in batch scheduling of conflicting jobs | 2009-10-23 | Paper |
| Scheduling with conflicts: Online and offline algorithms | 2009-09-25 | Paper |
| SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs | 2009-07-14 | Paper |
| Wireless Communication Is in APX | 2009-07-14 | Paper |
| Approximation algorithms for the weighted independent set problem in sparse graphs | 2009-06-30 | Paper |
| Independent sets in bounded-degree hypergraphs | 2009-06-24 | Paper |
| Independent Sets in Bounded-Degree Hypergraphs | 2009-02-17 | Paper |
| Fixed-Parameter Tractability for Non-Crossing Spanning Trees | 2009-02-17 | Paper |
| Complete partitions of graphs | 2008-10-21 | Paper |
| On representable graphs, semi-transitive orientations, and the representation numbers | 2008-10-01 | Paper |
| Vertex coloring acyclic digraphs and their corresponding hypergraphs | 2008-09-10 | Paper |
| Strip Graphs: Recognition and Scheduling | 2008-09-04 | Paper |
| Minimizing interference of a wireless ad-hoc network in a plane | 2008-08-14 | Paper |
| Batch Coloring Flat Graphs and Thin | 2008-07-15 | Paper |
| Min Sum Edge Coloring in Multigraphs Via Configuration LP | 2008-06-10 | Paper |
| “Rent-or-Buy” Scheduling and Cost Coloring Problems | 2008-04-24 | Paper |
| Strongly simplicial vertices of powers of trees | 2007-10-25 | Paper |
| Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs | 2007-08-28 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Scheduling Split Intervals | 2006-06-01 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829009 | 2004-11-29 | Paper |
| Randomized approximation of the stable marriage problem | 2004-10-27 | Paper |
| Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046486 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044355 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472492 | 2004-08-04 | Paper |
| Approximability results for stable marriage problems with ties. | 2004-03-14 | Paper |
| Approximation algorithms for the test cover problem | 2004-03-11 | Paper |
| Coloring Powers of Planar Graphs | 2004-01-08 | Paper |
| Powers of geometric intersection graphs and dispersion algorithms | 2003-12-04 | Paper |
| Multicoloring trees. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796174 | 2003-03-02 | Paper |
| Online independent sets. | 2003-01-21 | Paper |
| Approximating theDomatic Number | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780787 | 2002-11-21 | Paper |
| A matched approximation bound for the sum of a greedy coloring | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766829 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540056 | 2002-07-21 | Paper |
| Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees | 2002-07-11 | Paper |
| Approximations for the general block distribution of a matrix | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2718334 | 2002-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743804 | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952682 | 2001-08-02 | Paper |
| Approximation Algorithms for Dispersion Problems | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761856 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525728 | 2001-01-24 | Paper |
| Greedy Local Improvement and Weighted Set Packing Approximation | 2001-01-01 | Paper |
| Sum Multicoloring of Graphs | 2000-12-19 | Paper |
| Approximations of Weighted Independent Set and Hereditary Subset Problems | 2000-09-19 | Paper |
| On the approximation of largest common subtrees and largest common point sets | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944971 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219028 | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938668 | 2000-04-03 | Paper |
| Independent sets with domination constraints | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941827 | 2000-03-19 | Paper |
| Online coloring known graphs | 2000-03-12 | Paper |
| Finding Subsets Maximizing Minimum Structures | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252408 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268459 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252286 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246751 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400840 | 1998-12-10 | Paper |
| On chromatic sums and distributed resource allocation | 1998-09-27 | Paper |
| Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring | 1998-04-01 | Paper |
| Greed is good: Approximating independent sets in sparse and bounded-degree graphs | 1997-07-20 | Paper |
| Parallel and On-Line Graph Coloring | 1997-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886044 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886045 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4698692 | 1995-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763409 | 1995-04-11 | Paper |
| Lower bounds for on-line graph coloring | 1994-08-29 | Paper |
| Approximating the tree and tour covers of a graph | 1994-01-16 | Paper |
| Approximating the minimum maximal independence number | 1994-01-09 | Paper |
| A still better performance guarantee for approximate graph coloring | 1993-05-16 | Paper |
| Approximating maximum independent sets by excluding subgraphs | 1992-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010319 | 1992-09-27 | Paper |
