| Publication | Date of Publication | Type |
|---|
| Faster algorithms for \(k\)-\textsc{Subset Sum} and variations | 2023-08-10 | Paper |
| Designated-verifier linkable ring signatures with unconditional anonymity | 2023-07-26 | Paper |
| Optimal circle search despite the presence of faulty robots | 2023-06-05 | Paper |
| Byzantine fault tolerant symmetric-persistent circle evacuation | 2023-04-26 | Paper |
| Approximate \#knapsack computations to count semi-fair allocations | 2022-12-22 | Paper |
| Characterizations and approximability of hard counting classes below \#\textsf{P} | 2022-12-22 | Paper |
| Faster algorithms for \(k\)-subset sum and variations | 2022-12-08 | Paper |
| Designated-verifier linkable ring signatures | 2022-12-07 | Paper |
| Approximation schemes for subset-sums ratio problems | 2022-09-01 | Paper |
| Approximating subset sum ratio via subset sum computations | 2022-08-30 | Paper |
| Byzantine fault tolerant symmetric-persistent circle evacuation | 2022-06-24 | Paper |
| Completeness, approximability and exponential time results for counting problems with easy decision version | 2022-05-31 | Paper |
| Extension and its price for the connected vertex cover problem | 2022-02-01 | Paper |
| Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005184 | 2021-08-04 | Paper |
| Approximation schemes for subset sum ratio problems | 2021-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999211 | 2021-07-06 | Paper |
| On the complexity of the upper \(r\)-tolerant edge cover problem | 2021-03-01 | Paper |
| Extension and its price for the Connected Vertex Cover problem | 2020-02-25 | Paper |
| A faster FPTAS for the subset-sums ratio problem | 2018-10-04 | Paper |
| Minimum multiplicity edge coloring via orientation | 2018-09-06 | Paper |
| Path multicoloring in spider graphs with even color multiplicity | 2018-03-16 | Paper |
| Reliable communication via semilattice properties of partial knowledge | 2017-11-22 | Paper |
| On the connection between interval size functions and path counting | 2017-10-18 | Paper |
| Reliable broadcast with respect to topology knowledge | 2017-10-06 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Completeness Results for Counting Problems with Easy Decision | 2017-07-21 | Paper |
| Stathis Zachos at 70! | 2017-07-21 | Paper |
| Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs | 2017-04-04 | Paper |
| Energy-efficient broadcasting in ad hoc wireless networks | 2017-02-14 | Paper |
| Improved periodic data retrieval in asynchronous rings with a faulty host | 2015-12-11 | Paper |
| Reliable Broadcast with Respect to Topology Knowledge | 2015-02-10 | Paper |
| The Byzantine Generals Problem in Generic and Wireless Networks | 2014-10-30 | Paper |
| The Lazy Matroid Problem | 2014-09-15 | Paper |
| Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host | 2014-08-07 | Paper |
| The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design | 2013-08-16 | Paper |
| Selfish Resource Allocation in Optical Networks | 2013-06-07 | Paper |
| Periodic Metro Scheduling | 2012-09-28 | Paper |
| An experimental study of maximum profit wavelength assignment in WDM rings | 2011-06-22 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181697 | 2009-10-12 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On the Connection between Interval Size Functions and Path Counting | 2009-06-03 | Paper |
| On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks | 2009-01-29 | Paper |
| Randomized and Approximation Algorithms for Blue-Red Matching | 2008-09-17 | Paper |
| Distributed Routing in Tree Networks with Few Landmarks | 2008-04-17 | Paper |
| Selfish Routing and Path Coloring in All-Optical Networks | 2008-04-15 | Paper |
| Path multicoloring with fewer colors in spiders and caterpillars | 2007-11-19 | Paper |
| The Complexity of Counting Functions with Easy Decision Version | 2007-09-05 | Paper |
| Deterministic communication in radio networks with large labels | 2007-03-05 | Paper |
| Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474107 | 2004-08-04 | Paper |
| Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique | 2003-10-29 | Paper |
| Satisfying a maximum number of pre-routed requests in all-optical rings. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415064 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412042 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411387 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787343 | 2003-01-06 | Paper |
| Routing and path multicoloring | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953368 | 2000-05-09 | Paper |
