default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnastasios Viglas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j8]Khaled Almi'ani
, Anastasios Viglas, Young Choon Lee, Reza Abrishambaf:
Peripheral nodes and their effect in path planning in networks. Int. J. Ad Hoc Ubiquitous Comput. 27(3): 157-170 (2018)- 2016
- [j7]Khaled Almiani, Anastasios Viglas, Lavy Libman:
Tour and path planning methods for efficient data gathering using mobile elements. Int. J. Ad Hoc Ubiquitous Comput. 21(1): 11-25 (2016) - [j6]Khaled Almiani, Anastasios Viglas, Frans Schalekamp, Reza Abrishambaf:
Flow-based scheme for time-constrained data gathering in wireless sensor networks. Int. J. Wirel. Mob. Comput. 10(1): 1-12 (2016) - [c24]Vincent Gramoli, Michael A. Charleston, Bryn Jeffries, Irena Koprinska, Martin McGrane, Alex Radu, Anastasios Viglas, Kalina Yacef:
Mining autograding data in computer science education. ACSW 2016: 1 - 2014
- [j5]Martin Olsen, Anastasios Viglas:
On the approximability of the link building problem. Theor. Comput. Sci. 518: 96-116 (2014) - [c23]Khaled Almiani, Sanjay Chawla, Anastasios Viglas:
The Effect of Outliers in the Design of Data Gathering Tours. PAAP 2014: 209-214 - 2013
- [c22]George Karakostas, Raminder Kharaud, Anastasios Viglas:
Dynamics of a Localized Reputation-Based Network Protocol. PDCAT 2013: 147-152 - [c21]Khaled Almiani, Anastasios Viglas:
Designing Connected Tours That Almost Cover a Network. PDCAT 2013: 281-286 - [c20]Mohammed A. Abuhelaleh, Khaled Almiani, Anastasios Viglas:
Connected tours for sensor networks using clustering techniques. WOCC 2013: 432-437 - 2012
- [c19]Khaled Almiani, Mohammed A. Abuhelaleh, Anastasios Viglas:
Length-Constrained and Connected Tours for Sensor Networks. PDCAT 2012: 105-110 - [c18]George Karakostas, Anastasios Viglas:
Analysis of a Forwarding Game without Payments. PDCAT 2012: 691-696 - [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 Y. 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
2000 – 2009
- 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: 563-568 - [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. Comput. Aided Des. Integr. Circuits Syst. 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. Electron. Colloquium Comput. Complex. TR02 (2002) - 2000
- [c2]George Karakostas, Richard J. Lipton, Anastasios Viglas:
On the Complexity of Intersecting Finite State Automata. CCC 2000: 229-234
1990 – 1999
- 1999
- [c1]Richard J. Lipton, Anastasios Viglas:
On the Complexity of SAT. FOCS 1999: 459-464
Coauthor Index
aka: Khaled Almi'ani
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
