Evangelos Kranakis

From MaRDI portal
Person:215100

Available identifiers

zbMath Open kranakis.evangelosDBLPk/EvangelosKranakisWikidataQ57278603 ScholiaQ57278603MaRDI QIDQ215100

List of research outcomes





PublicationDate of PublicationType
Overcoming probabilistic faults in disoriented linear search2024-10-07Paper
Evacuation from a disk for robots with asymmetric communication2024-09-11Paper
Approximate maxima finding of continuous functions under restricted budget (extended abstract)2024-06-05Paper
Optimal circle search despite the presence of faulty robots2024-04-05Paper
VC-dimensions for graphs (extended abstract)2024-02-28Paper
https://portal.mardi4nfdi.de/entity/Q61878252024-01-15Paper
Overcoming probabilistic faults in disoriented linear search2024-01-11Paper
On multi-label linear interval routing schemes2024-01-05Paper
Search on a Line by Byzantine Robots2023-08-15Paper
Delivery to safety with two cooperating robots2023-08-14Paper
Optimal circle search despite the presence of faulty robots2023-06-05Paper
Message Delivery in the Plane by Robots with Different Speeds2023-04-21Paper
Gathering and Election by Mobile Robots in a Continuous Cycle.2023-02-03Paper
Optimal rendezvous on a line by location-aware robots in the presence of spies*2022-12-19Paper
Querying with Uncertainty2022-12-09Paper
Searching for a Non-adversarial, Uncooperative Agent on a Cycle2022-12-09Paper
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults2022-12-09Paper
Power consumption in packet radio networks (extended abstract)2022-11-09Paper
On convergence and threshold properties of discrete Lotka-Volterra population protocols2022-08-26Paper
Linear rendezvous with asymmetric clocks2022-07-21Paper
Energy consumption of group search on a line2022-07-21Paper
Bike assisted evacuation on a line2022-03-24Paper
The pony express communication problem2022-03-22Paper
Graph exploration by energy-sharing mobile agents2022-03-22Paper
The bike sharing problem2021-10-04Paper
Time-energy tradeoffs for evacuation by two robots in the wireless model2021-01-25Paper
Treasure evacuation with one robot on a disk2021-01-25Paper
Symmetry Breaking in the Plane2021-01-20Paper
Evacuating robots from a disk using face-to-face communication2021-01-05Paper
Distributed computing on oriented anonymous hypercubes with faulty components2020-12-03Paper
Exploring graphs with time constraints by unreliable collections of mobile robots2020-10-21Paper
Patrolling a path connecting a set of points with unbalanced frequencies of visits2020-10-21Paper
Gathering in the plane of location-aware robots in the presence of spies2020-08-25Paper
God save the queen2020-08-11Paper
On realizing shapes in the theory of RNA neutral networks2020-07-09Paper
Time-energy tradeoffs for evacuation by two robots in the wireless model2020-03-03Paper
Weak coverage of a rectangular barrier2020-02-28Paper
Plane and planarity thresholds for random geometric graphs2020-02-18Paper
Searching for a non-adversarial, uncooperative agent on a cycle2020-01-16Paper
Priority evacuation from a disk: the case of \(n = 1,2,3\)2020-01-16Paper
Search on a line with faulty robots2019-11-27Paper
Group search of the plane with faulty robots2019-10-07Paper
https://portal.mardi4nfdi.de/entity/Q52268422019-08-01Paper
Priority evacuation from a disk using mobile robots (extended abstract)2019-01-30Paper
Gathering in the plane of location-aware robots in the presence of spies2019-01-30Paper
Optimal shooting: Characterizations and applications2019-01-10Paper
Patrolling trees with mobile robots2018-12-07Paper
Search-and-fetch with one robot on a disk (track: wireless and geometry)2018-12-07Paper
Impact of locality on location aware unit disk graphs2018-08-20Paper
Search on a line by Byzantine robots2018-04-19Paper
Evacuation from a disc in the presence of a faulty robot2018-04-12Paper
Asymptotically optimal scheduling of random malleable demands in smart grid2018-04-10Paper
Know when to persist: deriving value from a stream buffer2018-03-13Paper
Evacuating two robots from multiple unknown exits in a circle2017-12-20Paper
Approximating the unsatisfiability threshold of random formulas (extended abstract)2017-12-05Paper
Lower bounds for compact routing (extended abstract)2017-11-16Paper
When patrolmen become corrupted: monitoring a graph using faulty mobile robots2017-11-09Paper
Search on a line with faulty robots2017-09-29Paper
Weak coverage of a rectangular barrier2017-07-21Paper
Linear Search with Terrain-Dependent Speeds2017-07-21Paper
Distributed patrolling with two-speed robots (and an application to transportation)2017-04-28Paper
Distributed algorithms for barrier coverage using relocatable sensors2017-04-04Paper
Different speeds suffice for rendezvous of two agents on arbitrary graphs2017-04-04Paper
Sensor allocation problems on the real line2016-12-09Paper
Know when to persist: deriving value from a stream buffer (extended abstract)2016-11-09Paper
Reconstructing cactus graphs from shortest path information (extended abstract)2016-11-09Paper
Survivability of bouncing robots2016-09-16Paper
On the displacement for covering a unit interval with randomly placed sensors2016-07-27Paper
When patrolmen become corrupted: monitoring a graph using faulty mobile robots2016-01-11Paper
Information spreading by mobile particles on a line2016-01-08Paper
The beachcombers' problem: walking and searching with mobile robots2015-12-11Paper
Strong connectivity of sensor networks with double antennae2015-12-10Paper
On convergence and threshold properties of discrete Lotka-Volterra population protocols2015-10-27Paper
Localization for a system of colliding robots2015-09-29Paper
Position discovery for a system of bouncing robots2015-09-28Paper
Searching for majority with \(k\)-tuple queries2015-07-01Paper
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae2015-06-10Paper
Excuse me! or the courteous theatregoers' problem2015-05-26Paper
Complexity of barrier coverage with relocatable sensors in the plane2015-05-18Paper
Minimizing congestion of layouts for ATM networks with faulty links2015-04-29Paper
Distributed algorithms for barrier coverage using relocatable sensors2015-03-02Paper
Evacuating robots via unknown exit in a disk2015-02-10Paper
On the event distance of Poisson processes with applications to sensors2014-12-03Paper
Displacing random sensors to avoid interference2014-09-26Paper
Randomized rendezvous with limited memory2014-09-09Paper
The beachcombers' problem: walking and searching with mobile robots2014-08-07Paper
Patrolling by robots equipped with visibility2014-08-07Paper
Asymptotic number of hairpins of saturated RNA secondary structures2014-04-22Paper
Survivability of swarms of bouncing robots2014-03-31Paper
Approximation algorithms for the antenna orientation problem2013-08-16Paper
Localization for a system of colliding robots2013-08-07Paper
Complexity of barrier coverage with relocatable sensors in the plane2013-06-07Paper
Position discovery for a system of bouncing robots2013-03-13Paper
On the page number of RNA secondary structures with pseudoknots2012-12-13Paper
Maintaining privacy on a line2012-12-06Paper
Computing majority with triple queries2012-11-27Paper
Strongly connected orientations of plane graphs2012-11-22Paper
Stretch factor in wireless sensor networks with directional antennae2012-11-02Paper
STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE2012-10-15Paper
Bounded length, 2-edge augmentation of geometric planar graphs2012-10-15Paper
Strong connectivity of sensor networks with double antennae2012-09-26Paper
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs2012-09-10Paper
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points2012-06-29Paper
Preventing the cluster formation attack against the hierarchical OLSR protocol2012-06-08Paper
Analysing local algorithms in location-aware quasi-unit-disk graphs2011-10-27Paper
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds2011-09-16Paper
Computing majority with triple queries2011-08-17Paper
Planar subgraphs without low-degree nodes2011-08-12Paper
Deterministic symmetric rendezvous with tokens in a synchronous torus2011-06-01Paper
Location-oblivious distributed unit disk graph coloring2011-05-10Paper
Maintaining connectivity in sensor networks using directional antennae2011-04-05Paper
Strong connectivity in sensor networks with given number of directional antennae of bounded angle2011-01-10Paper
Optimal balancing of satellite queues in packet transmission to ground stations2011-01-10Paper
Bounded length, 2-edge augmentation of geometric planar graphs2011-01-08Paper
The diameter and connectivity of networks with random dependent faults2010-11-24Paper
String recognition on anonymous rings2010-06-17Paper
Maximum interference of random sensors on a line2010-06-17Paper
Strong orientations of planar graphs with bounded stretch factor2010-06-17Paper
On the false-positive rate of Bloom filters2010-06-09Paper
Local construction and coloring of spanners of location aware unit disk graphs2010-03-11Paper
Playing with triangulations2010-02-05Paper
Random maximal independent sets and the unfriendly theater seating arrangement problem2009-12-15Paper
Optimal movement of mobile sensors for barrier coverage of a planar region2009-11-25Paper
Tracking mobile users in cellular networks using timing information2009-10-12Paper
Approximate hotlink assignment2009-07-21Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
An Algorithmic Theory of Mobile Agents2009-03-05Paper
Constant memory routing in quasi-planar and quasi-polyhedral graphs2009-03-04Paper
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs2009-02-12Paper
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region2009-01-27Paper
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs2009-01-20Paper
Mobile Agent Rendezvous in a Synchronous Torus2008-09-18Paper
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges2008-09-18Paper
Communication in Networks with Random Dependent Faults2008-09-17Paper
Memoryless search algorithms in a network with faulty advice2008-08-06Paper
Balancing Traffic Load Using One-Turn Rectilinear Routing2008-05-27Paper
Randomized Rendez-Vous with Limited Memory2008-04-15Paper
Rectilinear glass-cut dissections of rectangles to squares2008-04-03Paper
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring2008-03-07Paper
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs2007-11-15Paper
Location Oblivious Distributed Unit Disk Graph Coloring2007-11-15Paper
Assigning bookmarks in perfect binary trees.2007-09-21Paper
Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model2007-04-18Paper
Better adaptive diagnosis of hypercubes2007-01-09Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper
Deterministic M2M multicast in radio networks2006-10-20Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Asynchronous deterministic rendezvous in graphs2006-04-28Paper
Broadcasting in unlabeled hypercubes with a linear number of messages.2006-01-17Paper
Principles of Distributed Systems2005-12-15Paper
STACS 20052005-12-02Paper
Games on triangulations2005-10-26Paper
Structural Information and Communication Complexity2005-09-07Paper
Structural Information and Communication Complexity2005-09-07Paper
Automata, Languages and Programming2005-08-24Paper
Euro-Par 2004 Parallel Processing2005-08-23Paper
Information and Communications Security2005-08-19Paper
Applied Cryptography and Network Security2005-06-13Paper
https://portal.mardi4nfdi.de/entity/Q48289872004-11-29Paper
Tree exploration with little memory2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48176502004-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48176492004-09-15Paper
https://portal.mardi4nfdi.de/entity/Q44724762004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741412004-08-04Paper
Sorting and election in anonymous asynchronous rings.2004-03-14Paper
Searching with mobile agents in networks with liars.2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44375142003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44360572003-11-23Paper
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory2003-10-29Paper
The impact of information on broadcasting time in linear radio networks.2003-01-21Paper
Cutting circles into equal area pieces2002-09-18Paper
Rigorous results for random (\(2+p)\)-SAT2002-03-03Paper
Random constraint satisfaction: A more accurate picture2002-02-10Paper
https://portal.mardi4nfdi.de/entity/Q27668832002-01-28Paper
Optimal adaptive fault diagnosis for simple multiprocessor systems2002-01-27Paper
Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q45250522001-12-12Paper
https://portal.mardi4nfdi.de/entity/Q27288472001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q27288462001-11-01Paper
https://portal.mardi4nfdi.de/entity/Q27290932001-10-23Paper
Ray shooting from convex ranges2001-09-03Paper
Fault-tolerant broadcasting in radio networks2001-07-29Paper
On recognizing a string on an anonymous ring2001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q45040232000-12-06Paper
ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS2000-11-07Paper
Efficient regular polygon dissections2000-10-23Paper
Power consumption in packet radio networks2000-08-21Paper
Approximating the unsatisfiability threshold of random formulas2000-05-03Paper
https://portal.mardi4nfdi.de/entity/Q49387712000-03-27Paper
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks2000-03-19Paper
Baked-Potato Routing1999-10-25Paper
https://portal.mardi4nfdi.de/entity/Q42341011999-06-29Paper
Approximate maxima finding of continuous functions under restricted budget1999-01-12Paper
Perfect broadcasting in unlabeled networks1998-11-03Paper
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments1998-08-13Paper
Planar stage graphs: Characterizations and applications1998-07-23Paper
https://portal.mardi4nfdi.de/entity/Q43851721998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43757761998-02-08Paper
Stage-graph representations1998-01-29Paper
The VC-dimension of set systems defined by graphs1997-12-17Paper
Hop-Congestion Trade-Offs for High-Speed Networks1997-09-29Paper
Distributed Computing on Anonymous Hypercube Networks1997-07-06Paper
Anonymous wireless rings1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q47184231996-12-03Paper
On Multi-Label Linear Interval Routing Schemes1996-10-30Paper
Labeled versus unlabeled distributed Cayley networks1996-08-05Paper
https://portal.mardi4nfdi.de/entity/Q43262011995-07-13Paper
Counting problems relating to a theorem of Dirichlet1995-04-09Paper
Computing Boolean functions on anonymous networks1995-01-11Paper
Camera placement in integer lattices1994-08-10Paper
Optimal coteries and voting schemes1994-08-03Paper
https://portal.mardi4nfdi.de/entity/Q40386971993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40132451992-09-27Paper
A note on weighted distributed match-making1992-09-26Paper
Boolean Functions, Invariance Groups, and Parallel Complexity1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47333791989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47347641989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38231291988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967181988-01-01Paper
Fixed point equations with parameters in the projective model1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34858781987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37515871987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261861986-01-01Paper
Definable Partitions and the Projectum1985-01-01Paper
Definable partitions and reflection properties for regular cardinals1985-01-01Paper
DEFINABLE ULTRAPOWERS AND ULTRAFILTERS OVER ADMISSIBLE ORDINALS1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36891801984-01-01Paper
Stepping up lemmas in definable partitions1984-01-01Paper
Definable Ramsey and definable Erdös ordinals1983-01-01Paper
Definable Ultrafilters and end Extension of Constructible Sets1982-01-01Paper
Invisible Ordinals and Inductive Definitions1982-01-01Paper
Reflection and partition properties of admissible ordinals1982-01-01Paper

Research outcomes over time

This page was built for person: Evangelos Kranakis