![](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
- Hendrik Molter
Ben-Gurion University of The Negev, Israel
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 106 matches
- 2024
- Danny Hermelin
, Hendrik Molter
, Dvir Shabtay
:
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36(3): 836-848 (2024) - Sebastian Buß, Hendrik Molter
, Rolf Niedermeier, Maciej Rymar:
Algorithmic aspects of temporal betweenness. Netw. Sci. 12(2): 160-188 (2024) - Juhi Chaudhary
, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? AAAI 2024: 9582-9589 - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal Graph Realization from Fastest Paths. SAND 2024: 16:1-16:18 - Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR abs/2403.17587 (2024) - George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal transportation trees. CoRR abs/2403.18513 (2024) - Klaus Heeger, Hendrik Molter:
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR abs/2404.14208 (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) - Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135: 1-14 (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) - Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27(3): 173-194 (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) - Danny Hermelin, Yuval Itzhaki
, Hendrik Molter, Rolf Niedermeier:
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961: 113885 (2023) - Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188 - Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. STACS 2023: 30:1-30:19 - Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023) - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023) - Juhi Chaudhary
, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? CoRR abs/2309.09967 (2023) - 2022
- Roman Haag, Hendrik Molter, Rolf Niedermeier
, Malte Renken
:
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307: 65-78 (2022) - Hendrik Molter
:
The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett. 175: 106229 (2022) - Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. IPEC 2022: 18:1-18:16 - 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 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND 2022: 17:1-17:17 - Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. SAND 2022: 19:1-19:16 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
:
Delay-Robust Routes in Temporal Graphs. STACS 2022: 30:1-30:15 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR abs/2201.05011 (2022) - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. CoRR abs/2201.05390 (2022) - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR abs/2202.06841 (2022) - Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. CoRR abs/2202.12055 (2022)
skipping 76 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 10:19 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