| Publication | Date of Publication | Type |
|---|
Byzantine fault-tolerant protocols for (n,f)-evacuation from a circle
Theoretical Computer Science | 2025-04-07 | Paper |
| On the power of counting the total number of computation paths of NPTMs | 2024-11-12 | Paper |
Approximating subset sum ratio via partition computations
Acta Informatica | 2024-05-17 | Paper |
| Optimal circle search despite the presence of faulty robots | 2024-04-05 | Paper |
Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
Frontiers of Algorithmics | 2023-08-10 | Paper |
Designated-verifier linkable ring signatures with unconditional anonymity
Algebraic Informatics | 2023-07-26 | Paper |
Optimal circle search despite the presence of faulty robots
Information Processing Letters | 2023-06-05 | Paper |
Byzantine fault tolerant symmetric-persistent circle evacuation
Theoretical Computer Science | 2023-04-26 | Paper |
Approximate \#knapsack computations to count semi-fair allocations
(available as arXiv preprint) | 2022-12-22 | Paper |
Characterizations and approximability of hard counting classes below \#\textsf{P}
(available as arXiv preprint) | 2022-12-22 | Paper |
Faster algorithms for \(k\)-subset sum and variations
Journal of Combinatorial Optimization | 2022-12-08 | Paper |
| Designated-verifier linkable ring signatures | 2022-12-07 | Paper |
Approximation schemes for subset-sums ratio problems
Theoretical Computer Science | 2022-09-01 | Paper |
Approximating subset sum ratio via subset sum computations
(available as arXiv preprint) | 2022-08-30 | Paper |
Byzantine fault tolerant symmetric-persistent circle evacuation
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Completeness, approximability and exponential time results for counting problems with easy decision version
Theoretical Computer Science | 2022-05-31 | Paper |
Extension and its price for the connected vertex cover problem
Theoretical Computer Science | 2022-02-01 | Paper |
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
Discrete Mathematics, Algorithms and Applications | 2021-11-25 | Paper |
| scientific article; zbMATH DE number 7378397 (Why is no real title available?) | 2021-08-04 | Paper |
Approximation schemes for subset sum ratio problems
(available as arXiv preprint) | 2021-07-08 | Paper |
| Object allocation and positive graph externalities | 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
(available as arXiv preprint) | 2018-10-04 | Paper |
Minimum multiplicity edge coloring via orientation
Discrete Applied Mathematics | 2018-09-06 | Paper |
Path multicoloring in spider graphs with even color multiplicity
Information Processing Letters | 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
Computational Complexity | 2017-10-18 | Paper |
Reliable broadcast with respect to topology knowledge
Distributed Computing | 2017-10-06 | Paper |
Brief announcement: Reliable message transmission under partial knowledge and general adversaries
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Completeness results for counting problems with easy decision
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Stathis Zachos at 70!
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Different speeds suffice for rendezvous of two agents on arbitrary graphs
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Energy-efficient broadcasting in ad hoc wireless networks
Journal of Discrete Algorithms | 2017-02-14 | Paper |
Improved periodic data retrieval in asynchronous rings with a faulty host
Theoretical Computer Science | 2015-12-11 | Paper |
Reliable broadcast with respect to topology knowledge
Lecture Notes in Computer Science | 2015-02-10 | Paper |
The Byzantine generals problem in generic and wireless networks
Applications of Mathematics and Informatics in Science and Engineering | 2014-10-30 | Paper |
The Lazy Matroid Problem
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Improved periodic data retrieval in asynchronous rings with a faulty host
Structural Information and Communication Complexity | 2014-08-07 | Paper |
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Selfish resource allocation in optical networks
Lecture Notes in Computer Science | 2013-06-07 | Paper |
| Periodic metro scheduling | 2012-09-28 | Paper |
An experimental study of maximum profit wavelength assignment in WDM rings
Networks | 2011-06-22 | Paper |
Composing equipotent teams.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Resource allocation problems in multifiber WDM tree networks.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
| On the complexity of variations of equal sum subsets | 2009-10-12 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On the Connection between Interval Size Functions and Path Counting
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
Algorithms and Computation | 2009-01-29 | Paper |
Randomized and Approximation Algorithms for Blue-Red Matching
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Distributed Routing in Tree Networks with Few Landmarks
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Selfish Routing and Path Coloring in All-Optical Networks
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Path multicoloring with fewer colors in spiders and caterpillars
Computing | 2007-11-19 | Paper |
The Complexity of Counting Functions with Easy Decision Version
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Deterministic communication in radio networks with large labels
Algorithmica | 2007-03-05 | Paper |
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
Computer Networks | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2081007 (Why is no real title available?) | 2004-08-04 | Paper |
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
The Computer Journal | 2003-10-29 | Paper |
Satisfying a maximum number of pre-routed requests in all-optical rings.
Computer Networks | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1953880 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1948455 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1947418 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1849117 (Why is no real title available?) | 2003-01-06 | Paper |
Routing and path multicoloring
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1444332 (Why is no real title available?) | 2000-05-09 | Paper |
