default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatús Mihalák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j24]Steven Chaplick
, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. Discret. Appl. Math. 360: 275-281 (2025)- 2024
- [j23]Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna:
Sequential solutions in machine scheduling games. J. Sched. 27(4): 363-373 (2024) - [c62]Erik Boom, Matús Mihalák, Frank Thuijsman, Mark H. M. Winands:
Scheduling Single AGV in Blocking Flow-Shop with Identical Jobs. ICORES 2024: 325-332 - [c61]Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. SOFSEM 2024: 40-54 - [i18]Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. CoRR abs/2403.10868 (2024) - 2023
- [c60]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: A Treewidth Story. WG 2023: 187-200 - [i17]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: a Treewidth Story. CoRR abs/2302.10662 (2023) - [i16]Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. CoRR abs/2309.01110 (2023) - 2022
- [i15]Florian Wimmenauer, Matús Mihalák, Mark H. M. Winands:
Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics. CoRR abs/2212.07543 (2022) - 2021
- [j22]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) - [j21]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868: 87-96 (2021) - 2020
- [j20]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - [c59]Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna:
Sequential Solutions in Machine Scheduling Games. WINE 2020: 309-322
2010 – 2019
- 2019
- [c58]Matús Mihalák, Marc Pont:
On Sorting with a Network of Two Stacks. ATMOS 2019: 3:1-3:12 - [c57]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 - [c56]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO 2019: 139-153 - 2018
- [j19]Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani:
Improved bounds on equilibria solutions in the network design game. Int. J. Game Theory 47(4): 1113-1135 (2018) - [j18]Joachim M. Buhmann, Alexey Gronskiy, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci. 94: 135-166 (2018) - [j17]Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. Theory Comput. Syst. 62(3): 600-621 (2018) - [c55]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes 2018: 191-215 - [c54]Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis:
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. COCOON 2018: 554-566 - [c53]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC 2018: 45:1-45:12 - [c52]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective Fast Delivery by Energy-Efficient Agents. MFCS 2018: 56:1-56:16 - [i14]Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR abs/1807.01962 (2018) - [i13]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective fast delivery by energy-efficient agents. CoRR abs/1809.00077 (2018) - 2016
- [j16]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. 58(1): 45-59 (2016) - [j15]Markus Bohlin, Sara Gestrelius, Florian Dahms, Matús Mihalák, Holger Flier:
Optimization Methods for Multistage Freight Train Formation. Transp. Sci. 50(3): 823-840 (2016) - [c51]Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov:
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. ANALCO 2016: 93-105 - [c50]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. CSR 2016: 102-116 - [c49]Katerina Böhmová, Enrico Kravina, Matús Mihalák:
Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. ISCO 2016: 345-356 - [c48]Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek:
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. LATIN 2016: 220-234 - [c47]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof Mechanisms for Two-Values Domains. SAGT 2016: 289-301 - [c46]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [c45]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs. WG 2016: 282-294 - [i12]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - [i11]Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna:
Sequential Solutions in Machine Scheduling Games. CoRR abs/1611.04159 (2016) - 2015
- [j14]Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. Internet Math. 11(4-5): 472-486 (2015) - [j13]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel:
Selecting vertex disjoint paths in plane graphs. Networks 66(2): 136-144 (2015) - [j12]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11(4): 33:1-33:16 (2015) - [j11]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562: 557-564 (2015) - [c44]Katerina Böhmová, Matús Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer:
Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. ATMOS 2015: 68-81 - [c43]Matús Mihalák, Sandro Montanari:
Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. ATMOS 2015: 82-94 - [c42]Akaki Mamageishvili, Matús Mihalák:
Multicast Network Design Game on a Ring. COCOA 2015: 439-451 - [c41]Barbara Geissmann, Matús Mihalák, Peter Widmayer:
Recurring Comparison Faults: Sorting and Finding the Minimum. FCT 2015: 227-239 - [i10]Akaki Mamageishvili, Matús Mihalák:
Multicast Network Design Game on a Ring. CoRR abs/1507.04222 (2015) - [i9]Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov:
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. CoRR abs/1507.07727 (2015) - [i8]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof mechanisms for two-values domains. CoRR abs/1512.04277 (2015) - 2014
- [j10]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553: 106-113 (2014) - [c40]Stefan Funke, Matús Mihalák:
Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS 2014: i-ix - [c39]Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer:
Improved bounds for the conflict-free chromatic art gallery problem. SoCG 2014: 144 - [c38]Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) 2014: 423-434 - [c37]Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer:
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO 2014: 208-220 - [c36]Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani:
An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games. MFCS (2) 2014: 541-552 - [e1]Stefan Funke, Matús Mihalák:
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland. OASIcs 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-75-0 [contents] - [i7]Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani:
An $H_{n/2}$ Upper Bound on the Price of Stability of Undirected Network Design Games. CoRR abs/1406.3597 (2014) - 2013
- [j9]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013) - [j8]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. 161(10-11): 1287-1307 (2013) - [j7]Matús Mihalák, Jan Christoph Schlegel:
The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Theory Comput. Syst. 53(1): 53-72 (2013) - [c35]Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer:
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c34]Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013: 111-122 - [c33]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer:
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS 2013: 27-41 - [c32]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC 2013: 158-169 - [c31]Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty. ITCS 2013: 505-514 - [c30]Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer:
Interval Selection with Machine-Dependent Intervals. WADS 2013: 170-181 - [c29]Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA 2013: 156-167 - [c28]Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. WAW 2013: 118-129 - [i6]Matús Mihalák, Rastislav Srámek:
Counting approximately-shortest paths in directed acyclic graphs. CoRR abs/1304.6707 (2013) - [i5]Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. CoRR abs/1310.8245 (2013) - 2012
- [j6]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012) - [c27]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89 - [c26]Matús Mihalák, Jan Christoph Schlegel:
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. MFCS 2012: 693-704 - [c25]Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Polygons with Agents That Measure Angles. WAFR 2012: 415-425 - [i4]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012) - [i3]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012) - 2011
- [j5]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) - [j4]Yann Disser, Matús Mihalák, Peter Widmayer:
A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011) - [c24]Markus Bohlin, Holger Flier, Jens Maue, Matús Mihalák:
Track Allocation in Freight-Train Classification with Mixed Tracks. ATMOS 2011: 38-51 - [c23]Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer:
On the Complexity of the Metric TSP under Stability Considerations. SOFSEM 2011: 382-393 - [c22]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - [c21]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych:
Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166 - 2010
- [j3]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010) - [c20]Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych:
Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73 - [c19]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 - [c18]Matús Mihalák, Jan Christoph Schlegel:
The Price of Anarchy in Network Creation Games Is (Mostly) Constant. SAGT 2010: 276-287 - [c17]Yann Disser, Matús Mihalák, Peter Widmayer:
Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24
2000 – 2009
- 2009
- [c16]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 - [c15]Anvesh Komuravelli, Matús Mihalák:
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. SSS 2009: 458-471 - [c14]Thomas Erlebach, Matús Mihalák:
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA 2009: 135-146 - [p1]Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer:
Shunting for Dummies: An Introductory Algorithmic Survey. Robust and Online Large-Scale Optimization 2009: 310-337 - 2008
- [c13]Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124 - [c12]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph?. ISAAC 2008: 318-329 - [c11]Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 - [c10]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 - [c9]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - [c8]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking. SWAT 2008: 65-76 - [i2]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008) - 2007
- [j2]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - [c7]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45 - [c6]Thomas Erlebach, Alexander Hall, Matús Mihalák:
Approximate Discovery of Random Graphs. SAGA 2007: 82-92 - 2006
- [j1]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24(12): 2168-2181 (2006) - [c5]Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14 - [c4]Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák:
Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80 - 2005
- [c3]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. WG 2005: 127-138 - [i1]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [c2]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 - [c1]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
Joint Base Station Scheduling. WAOA 2004: 225-238
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 2025-03-04 22:23 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:
