default search action
Hendrik Molter
Person information
- affiliation: Ben-Gurion University of The Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j29]Danny Hermelin
, Hendrik Molter
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36(3): 836-848 (2024) - [j28]Danny Hermelin, Yuval Itzhaki
On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. 144: 103533 (2024) - [j27]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. 144: 103549 (2024) - [j26]Nina Klobas
The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. 146: 103564 (2024) - [j25]Jiehua Chen
Cluster Editing for Multi-Layer and Temporal Graphs. Theory Comput. Syst. 68(5): 1239-1290 (2024) - [j24]Sebastian Buß, Hendrik Molter
Algorithmic aspects of temporal betweenness. Netw. Sci. 12(2): 160-188 (2024) - [c40]Juhi Chaudhary
How to Make Knockout Tournaments More Popular? AAAI 2024: 9582-9589 - [c39]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. IJCAI 2024: 2704-2712 - [c38]Matthias Kaul, Matthias Mnich, Hendrik Molter:
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. IPEC 2024: 19:1-19:15 - [c37]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal Graph Realization from Fastest Paths. SAND 2024: 16:1-16:18 - [i44]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR abs/2403.17587 (2024) - [i43]George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal transportation trees. CoRR abs/2403.18513 (2024) - [i42]Klaus Heeger, Hendrik Molter:
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR abs/2404.14208 (2024) - [i41]Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Fair Repetitive Interval Scheduling. CoRR abs/2407.03987 (2024) - [i40]Matthias Kaul, Matthias Mnich, Hendrik Molter:
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. CoRR abs/2408.12967 (2024) - 2023
- [j23]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) - [j22]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) - [j21]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - [j20]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) - [j19]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - [j18]Danny Hermelin, Yuval Itzhaki
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961: 113885 (2023) - [c36]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188 - [c35]Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. STACS 2023: 30:1-30:19 - [i39]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023) - [i38]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023) - [i37]Juhi Chaudhary
How to Make Knockout Tournaments More Popular? CoRR abs/2309.09967 (2023) - 2022
- [j17]Roman Haag, Hendrik Molter, Rolf Niedermeier
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307: 65-78 (2022) - [j16]Hendrik Molter
The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett. 175: 106229 (2022) - [c34]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. IPEC 2022: 18:1-18:16 - [c33]Nina Klobas
The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS 2022: 62:1-62:15 - [c32]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND 2022: 17:1-17:17 - [c31]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. SAND 2022: 19:1-19:16 - [c30]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. STACS 2022: 30:1-30:15 - [i36]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR abs/2201.05011 (2022) - [i35]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. CoRR abs/2201.05390 (2022) - [i34]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - [i33]Danny Hermelin, Hendrik Molter, Dvir Shabtay:
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR abs/2202.06841 (2022) - [i32]Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. CoRR abs/2202.12055 (2022) - [i31]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. CoRR abs/2206.12825 (2022) - 2021
- [j15]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. Algorithmica 83(1): 1-44 (2021) - [j14]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83(9): 2754-2802 (2021) - [j13]George B. Mertzios
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120: 97-115 (2021) - [j12]Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. Theory Comput. Syst. 65(8): 1243-1282 (2021) - [j11]Hendrik Molter
Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1): S83-S105 (2021) - [c29]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [c28]Nicolas Maack, Hendrik Molter
On Finding Separators in Temporal Split and Permutation Graphs. FCT 2021: 385-398 - [c27]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096 - [c26]George B. Mertzios, Hendrik Molter, Malte Renken
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - [c25]Hendrik Molter, Malte Renken
Temporal Reachability Minimization: Delaying vs. Deleting. MFCS 2021: 76:1-76:15 - [c24]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG 2021: 219-231 - [i30]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i29]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal Reachability Minimization: Delaying vs. Deleting. CoRR abs/2102.10814 (2021) - [i28]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - [i27]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. CoRR abs/2105.12003 (2021) - [i26]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR abs/2105.13055 (2021) - [i25]Hendrik Molter:
The Complexity of Finding Temporal Separators under Waiting Time Constraints. CoRR abs/2107.01609 (2021) - [i24]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. CoRR abs/2112.06172 (2021) - [i23]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling for the Total Completion Time Objective. CoRR abs/2112.13824 (2021) - 2020
- [b1]Hendrik Molter:
Classic graph problems made temporal - a parameterized complexity analysis. Technical University of Berlin, Germany, 2020, ISBN 978-3-7983-3172-3, pp. 1-206 - [j10]Henning Fernau
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j9]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39(1): 216-245 (2020) - [j8]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107: 72-92 (2020) - [j7]René van Bevern
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - [j6]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806: 197-218 (2020) - [c23]Till Fluschnik
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms 2020: 49-77 - [c22]Arnaud Casteigts
Finding Temporal Paths Under Waiting Time Constraints. ISAAC 2020: 30:1-30:18 - [c21]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic Aspects of Temporal Betweenness. KDD 2020: 2084-2092 - [c20]George B. Mertzios
Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14 - [c19]Roman Haag, Hendrik Molter
Feedback Edge Sets in Temporal Graphs. WG 2020: 200-212 - [i22]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. CoRR abs/2003.13641 (2020) - [i21]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR abs/2004.13491 (2020) - [i20]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic Aspects of Temporal Betweenness. CoRR abs/2006.08668 (2020) - [i19]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020)
2010 – 2019
- 2019
- [j5]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24(1): 1.13:1-1.13:27 (2019) - [j4]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7(2): 215-241 (2019) - [c18]George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. AAAI 2019: 7667-7674 - [c17]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) 2019: 519-531 - [i18]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i17]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. CoRR abs/1909.06292 (2019) - [i16]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR abs/1909.06437 (2019) - 2018
- [j3]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30: 20-50 (2018) - [c16]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM 2018: 41-46 - [c15]Henning Fernau
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c14]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. FSTTCS 2018: 46:1-46:15 - [c13]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC 2018: 24:1-24:13 - [c12]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO 2018: 183-195 - [c11]Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. IPEC 2018: 7:1-7:14 - [c10]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Complexity of Finding Small Separators in Temporal Graphs. MFCS 2018: 45:1-45:17 - [c9]Clemens Hoffmann, Hendrik Molter, Manuel Sorge:
The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM 2018: 111-124 - [c8]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. WG 2018: 216-227 - [i15]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR abs/1801.10401 (2018) - [i14]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. CoRR abs/1803.00882 (2018) - [i13]Junjie Luo, Hendrik Molter, Ondrej Suchý:
A Parameterized Complexity View on Collapsing k-Cores. CoRR abs/1805.12453 (2018) - [i12]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. CoRR abs/1806.10210 (2018) - [i11]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. CoRR abs/1810.06625 (2018) - [i10]George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. CoRR abs/1811.04753 (2018) - 2017
- [j2]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1): 35:1-35:16 (2017) - [c7]Robert Bredereck
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC 2017: 128-139 - [c6]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-Like Graphs. WG 2017: 249-262 - [i9]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-like Graphs. CoRR abs/1703.02332 (2017) - [i8]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
A Parameterized View on Multi-Layer Cluster Editing. CoRR abs/1709.09100 (2017) - [i7]Clemens Hoffmann, Hendrik Molter, Manuel Sorge:
The Parameterized Complexity of Centrality Improvement in Networks. CoRR abs/1710.01576 (2017) - [i6]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR abs/1711.00963 (2017) - 2016
- [j1]Carme Àlvarez, Maria J. Blesa
Firefighting as a Strategic Game. Internet Math. 12(1-2): 101-120 (2016) - [c5]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating maximal cliques in temporal graphs. ASONAM 2016: 337-344 - [c4]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c3]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [i5]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i4]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR abs/1604.07724 (2016) - [i3]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating Maximal Cliques in Temporal Graphs. CoRR abs/1605.03871 (2016) - [i2]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - [i1]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - 2014
- [c2]Carme Àlvarez, Maria J. Blesa
Firefighting as a Game. WAW 2014: 108-119 - 2012
- [c1]Timo Kötzing, Hendrik Molter:
ACO Beats EA on a Dynamic Pseudo-Boolean Function. PPSN (1) 2012: 113-122
Coauthor Index
[j24] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [c32] [c31] [c30] [i36] [i35] [j15] [j11] [c29] [c28] [c27] [c24] [i28] [i27] [i26] [i24] [i23] [j10] [j9] [j8] [j7] [j6] [c23] [c21] [c20] [c19] [i22] [i21] [i20] [i19] [j5] [j4] [c17] [i18] [i17] [c16] [c15] [c14] [c12] [c10] [c8] [i15] [i14] [i12] [i11] [j2] [c7] [i6] [c5] [c4] [i5] [i4] [i3] [i1]
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-12-10 21:41 CET 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: