default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristina Karousatou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Sylvaine Kerboeuf
, Pawani Porambage, Akshay Jain, Patrik Rugeland, Gustav Wikström, Mårten Ericson, Dinh Thai Bui, Abdelkader Outtagarts, Heikki Karvonen, Pol Alemany, Raul Muñoz, Ricard Vilalta, Panagiotis Botsinis, Aurora Ramos, Josué Castañeda Cisneros, Mehmet Karaca, Christina Karousatou, Sokratis Barmpounakis, Panagiotis Demestichas, Anastasios Zafeiropoulos, Ioannis Tzanettis, Symeon Papavassiliou, Pietro G. Giardina, Giada Landi, Bin Han, Ahmad Nimr, Mikko A. Uusitalo:
Design Methodology for 6G End-to-End System: Hexa-X-II Perspective. IEEE Open J. Commun. Soc. 5: 3368-3394 (2024)- 2021
- [j5]Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849: 35-46 (2021) - [j4]Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou:
An improved lower bound for competitive graph exploration. Theor. Comput. Sci. 868: 65-86 (2021) - 2020
- [i2]Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou:
Improved Lower Bound for Competitive Graph Exploration. CoRR abs/2002.10958 (2020)
2010 – 2019
- 2019
- [c4]Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO 2019: 52-65 - 2018
- [j3]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Minimum multiplicity edge coloring via orientation. Discret. Appl. Math. 247: 380-388 (2018) - [j2]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Path multicoloring in spider graphs with even color multiplicity. Inf. Process. Lett. 133: 1-4 (2018) - [j1]Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. Theory Comput. Syst. 62(5): 1223-1240 (2018) - [i1]Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou:
Maximal Exploration of Trees with Energy-Constrained Agents. CoRR abs/1802.06636 (2018) - 2017
- [c3]Evangelos Bampas, Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. ALGOSENSORS 2017: 1-12 - 2015
- [c2]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Scheduling Connections via Path and Edge Multicoloring. ADHOC-NOW 2015: 33-47 - [c1]Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Exploration by Energy-Constrained Mobile Robots. SIROCCO 2015: 357-369
Coauthor Index
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-07-20 20:26 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:
