Anastasios Viglas

According to our database1, Anastasios Viglas authored at least 32 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Peripheral nodes and their effect in path planning in networks.
Int. J. Ad Hoc Ubiquitous Comput., 2018

2016
Flow-based scheme for time-constrained data gathering in wireless sensor networks.
Int. J. Wirel. Mob. Comput., 2016

Tour and path planning methods for efficient data gathering using mobile elements.
Int. J. Ad Hoc Ubiquitous Comput., 2016

Mining autograding data in computer science education.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2014
On the approximability of the link building problem.
Theor. Comput. Sci., 2014

The Effect of Outliers in the Design of Data Gathering Tours.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2013
Connected tours for sensor networks using clustering techniques.
Proceedings of the 22nd Wireless and Optical Communication Conference, 2013

Dynamics of a Localized Reputation-Based Network Protocol.
Proceedings of the International Conference on Parallel and Distributed Computing, 2013

Designing Connected Tours That Almost Cover a Network.
Proceedings of the International Conference on Parallel and Distributed Computing, 2013

2012
An approximation algorithm for the link building problem
CoRR, 2012

Analysis of a Forwarding Game without Payments.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

Length-Constrained and Connected Tours for Sensor Networks.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

2011
Mobile Element Path Planning for Gathering Transit-Time Constrained Data.
Proceedings of the 12th International Conference on Parallel and Distributed Computing, 2011

2010
Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks.
Proceedings of the 35th Annual IEEE Conference on Local Computer Networks, 2010

A Constant-Factor Approximation Algorithm for the Link Building Problem.
Proceedings of the Combinatorial Optimization and Applications, 2010

A Topology Control Algorithm with Good Spanner Properties for Wireless Sensor Networks.
Proceedings of the 8th Annual Conference on Communication Networks and Services Research, 2010

Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks.
Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, 2010

2009
ECTC: Energy effiCient topology control algorithm for wireless sensor networks.
Proceedings of the 10th IEEE International Symposium on a World of Wireless, 2009

A Data Caching Approach for Sensor Applications.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

2008
Periodic Mobile Multi-Gateway Scheduling.
Proceedings of the Ninth International Conference on Parallel and Distributed Computing, 2008

RMC: An Energy-Aware Cross-Layer Data-Gathering Protocol for Wireless Sensor Networks.
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007
Equilibria for networks with malicious users.
Math. Program., 2007

Selfish Routing with Oblivious Users.
Proceedings of the Structural Information and Communication Complexity, 2007

An incremental data-stream sketch using sparse random projections.
Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

2005
Fault diagnosis and logic debugging using Boolean satisfiability.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

Time-space lower bounds for satisfiability.
J. ACM, 2005

On-Line Algorithms for Market Equilibria.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Design diagnosis using Boolean satisfiability.
Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004

2003
On the complexity of intersecting finite state automata and N L versus N P.
Theor. Comput. Sci., 2003

2002
Non-uniform Depth of Polynomial Time and Space Simulations
Electron. Colloquium Comput. Complex., 2002

2000
On the Complexity of Intersecting Finite State Automata.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
On the Complexity of SAT.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999


  Loading...