| Publication | Date of Publication | Type |
|---|
Opinion evolution among friends and foes: the deterministic majority rule
Theoretical Computer Science | 2023-05-12 | Paper |
A note on the satisfactory partition problem: constant size requirement
Information Processing Letters | 2022-10-28 | Paper |
Complexity of Scorpion solitaire and applications to Klondike
Theoretical Computer Science | 2021-10-21 | Paper |
Min-max communities in graphs: complexity and computational properties
Theoretical Computer Science | 2015-12-28 | Paper |
Reducing the diameter of a unit disk graph via node addition
Information Processing Letters | 2015-07-15 | Paper |
Distributed community detection in dynamic graphs
Theoretical Computer Science | 2015-05-22 | Paper |
Distributed Community Detection in Dynamic Graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Smooth movement and Manhattan path based random waypoint mobility
Information Processing Letters | 2013-04-04 | Paper |
Spatial node distribution of Manhattan path based random waypoint mobility models with applications
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Minimum-energy broadcast and disk cover in grid wireless networks
Theoretical Computer Science | 2008-06-24 | Paper |
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Approximating call-scheduling makespan in all-optical networks
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
Journal of Parallel and Distributed Computing | 2004-08-19 | Paper |
Deadlock prevention by acyclic orientations
Discrete Applied Mathematics | 2003-07-30 | Paper |
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theoretical Computer Science | 2003-05-25 | Paper |
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1696518 (Why is no real title available?) | 2002-08-11 | Paper |
| scientific article; zbMATH DE number 1760003 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1500650 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1305047 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1107721 (Why is no real title available?) | 1998-09-27 | Paper |
Efficient delay routing
Theoretical Computer Science | 1998-08-13 | Paper |
Computation Models for Parameterized Complexity
Mathematical Logic Quarterly | 1997-05-14 | Paper |
| scientific article; zbMATH DE number 906536 (Why is no real title available?) | 1996-11-04 | Paper |
OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS
International Journal of Foundations of Computer Science | 1996-01-28 | Paper |
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
