Miriam Di Ianni

Available identifiers

zbMath Open di-ianni.miriamMaRDI QIDQ876730

List of research outcomes

Publication	Date of Publication	Type
Opinion evolution among friends and foes: the deterministic majority rule	2023-05-12	Paper
A note on the satisfactory partition problem: constant size requirement	2022-10-28	Paper
Complexity of scorpion solitaire and applications to klondike	2021-10-21	Paper
Min-max communities in graphs: complexity and computational properties	2015-12-28	Paper
Reducing the diameter of a unit disk graph via node addition	2015-07-15	Paper
Distributed community detection in dynamic graphs	2015-05-22	Paper
Distributed Community Detection in Dynamic Graphs	2013-12-17	Paper
Smooth movement and Manhattan path based random waypoint mobility	2013-04-04	Paper
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications	2010-02-24	Paper
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks	2009-03-12	Paper
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings	2009-01-20	Paper
Minimum-energy broadcast and disk cover in grid wireless networks	2008-06-24	Paper
On the bounded-hop MST problem on random Euclidean instances	2007-10-02	Paper
STACS 2004	2007-10-01	Paper
Approximating call-scheduling makespan in all-optical networks	2007-04-26	Paper
Structural Information and Communication Complexity	2005-11-30	Paper
Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks	2004-08-19	Paper
Deadlock prevention by acyclic orientations	2003-07-30	Paper
The minimum broadcast range assignment problem on linear multi-hop wireless networks.	2003-05-25	Paper
Approximation algorithms for routing and call scheduling in all-optical chains and rings.	2003-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q2766665	2002-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4536925	2002-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4501672	2000-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4251980	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4373669	1998-09-27	Paper
Efficient delay routing	1998-08-13	Paper
Computation Models for Parameterized Complexity	1997-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q4885618	1996-11-04	Paper
OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS	1996-01-28	Paper
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING	1990-01-01	Paper

Research outcomes over time

This page was built for person: Miriam Di Ianni