- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i2 |      | Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk: An approximation algorithm for the link building problem. CoRR abs/1204.1369 (2012) |
| 2011 | ||
| c17 | | Khaled Almiani, Anastasios Viglas, Mohammed Aalsalem: Mobile Element Path Planning for Gathering Transit-Time Constrained Data. PDCAT 2011: 221-226 |
| 2010 | ||
| c16 | | Khaled Almiani, Anastasios Viglas, Lavy Libman: Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks. AINA 2010: 843-850 |
| c15 | | Nedal Ababneh, Anastasios Viglas, S. Selvakennedy, Nadia Boukhatem: A Topology Control Algorithm with Good Spanner Properties for Wireless Sensor Networks. CNSR 2010: 179-186 |
| c14 | | Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk: A Constant-Factor Approximation Algorithm for the Link Building Problem. COCOA (2) 2010: 87-96 |
| c13 | | Khaled Almiani, Anastasios Viglas, Lavy Libman: Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks. LCN 2010: 582-589 |
| 2009 | ||
| c12 | | Khaled Almiani, Javid Taheri, Anastasios Viglas: A Data Caching Approach for Sensor Applications. PDCAT 2009: 88-93 |
| c11 | | Nedal Ababneh, Anastasios Viglas, Houda Labiod, Nadia Boukhatem: ECTC: Energy effiCient topology control algorithm for wireless sensor networks. WOWMOM 2009: 1-9 |
| 2008 | ||
| c10 | | Khaled Almiani, S. Selvakennedy, Anastasios Viglas: RMC: An Energy-Aware Cross-Layer Data-Gathering Protocol for Wireless Sensor Networks. AINA 2008: 410-417 |
| c9 | | Khaled Almiani, Selvakennedy Selvadurai, Anastasios Viglas: Periodic Mobile Multi-Gateway Scheduling. PDCAT 2008: 195-202 |
| 2007 | ||
| j4 | | George Karakostas, Anastasios Viglas: Equilibria for networks with malicious users. Math. Program. 110(3): 591-613 (2007) |
| c8 | | Aditya Krishna Menon, Gia Vinh Anh Pham, Sanjay Chawla, Anastasios Viglas: An incremental data-stream sketch using sparse random projections. SDM 2007 |
| c7 | | George Karakostas, Taeyon Kim, Anastasios Viglas, Hao Xia: Selfish Routing with Oblivious Users. SIROCCO 2007: 318-327 |
| 2005 | ||
| j3 | | Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas: Time-space lower bounds for satisfiability. J. ACM 52(6): 835-865 (2005) |
| j2 | | Alexander Smith, Andreas G. Veneris, Moayad Fahim Ali, Anastasios Viglas: Fault diagnosis and logic debugging using Boolean satisfiability. IEEE Trans. on CAD of Integrated Circuits and Systems 24(10): 1606-1621 (2005) |
| c6 | | Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas: On-Line Algorithms for Market Equilibria. COCOON 2005: 596-607 |
| 2004 | ||
| c5 | | Alexander Smith, Andreas G. Veneris, Anastasios Viglas: Design diagnosis using Boolean satisfiability. ASP-DAC 2004: 218-223 |
| 2003 | ||
| j1 | | George Karakostas, Richard J. Lipton, Anastasios Viglas: On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. 302(1-3): 257-274 (2003) |
| c4 | | Richard J. Lipton, Anastasios Viglas: Non-uniform Depth of Polynomial Time and Space Simulations. FCT 2003: 311-320 |
| c3 | | George Karakostas, Anastasios Viglas: Equilibria for Networks with Malicious Users. ISAAC 2003: 696-704 |
| 2002 | ||
| i1 | | Richard J. Lipton, Anastasios Viglas: Non-uniform Depth of Polynomial Time and Space Simulations. Electronic Colloquium on Computational Complexity (ECCC)(057) (2002) |
| 2000 | ||
| c2 | | George Karakostas, Richard J. Lipton, Anastasios Viglas: On the Complexity of Intersecting Finite State Automata. IEEE Conference on Computational Complexity 2000: 229-234 |
| 1999 | ||
| c1 | | |
Colors in the list of coauthors
Last update Wed May 22 11:49:54 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page