![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- George B. Mertzios
Durham University, UK
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 167 matches
- 2024
- Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024) - Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
:
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024) - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal Graph Realization from Fastest Paths. SAND 2024: 16:1-16:18 - George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. SAND 2024: 27:1-27:5 - Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. CoRR abs/2403.02198 (2024) - George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal transportation trees. CoRR abs/2403.18513 (2024) - George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the existence of δ-temporal cliques in random simple temporal graphs. CoRR abs/2404.07147 (2024) - David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff:
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem. CoRR abs/2406.14729 (2024) - 2023
- Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1): 1 (2023) - George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
, Philipp Zschoche:
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter
, Rolf Niedermeier, Dvir Shabtay:
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - Nina Klobas, George B. Mertzios, Paul G. Spirakis:
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS 2023: 5:1-5:12 - Tom Friedetzky
, David C. Kutner
, George B. Mertzios
, Iain A. Stewart
, Amitabh Trehan
:
Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282 - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023) - Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
:
Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023) - 2022
- Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI 2022: 10193-10201 - George B. Mertzios
, Othon Michail
, George Skretas
, Paul G. Spirakis
, Michail Theofilatos
:
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - Nina Klobas
, George B. Mertzios
, Hendrik Molter
, Paul G. Spirakis
:
The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS 2022: 62:1-62:15 - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR abs/2204.04832 (2022) - 2021
- Eleni C. Akrida
, George B. Mertzios
, Paul G. Spirakis
, Christoforos L. Raptopoulos:
The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120: 179-193 (2021) - Jessica A. Enright, Kitty Meeks, George B. Mertzios
, Viktor Zamaraev
:
Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119: 60-77 (2021) - George B. Mertzios
, Hendrik Molter, Viktor Zamaraev
:
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120: 97-115 (2021) - Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096 - George B. Mertzios, Hendrik Molter, Malte Renken
, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021)
skipping 137 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 04:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint