default search action
Tamara Mchedlidze
Person information
- affiliation: Utrecht University, The Netherlands
- affiliation (former): Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j32]Simon van Wageningen
, Tamara Mchedlidze
An Experimental Evaluation of Viewpoint-Based 3D Graph Drawing. Comput. Graph. Forum 43(3) (2024) - [j31]Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. J. Graph Algorithms Appl. 28(2): 47-82 (2024) - [c54]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-Bend Upward Point-Set Embeddings of st-Digraphs. LATIN (1) 2024: 3-18 - [i40]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-bend Upward Point-set Embeddings of st-digraphs. CoRR abs/2401.03226 (2024) - [i39]Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec, Jules Wulms:
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. CoRR abs/2402.12357 (2024) - 2023
- [j30]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023) - [j29]Tamara Mchedlidze, Elena Arseneva:
Editorial. Comput. Geom. 110: 101962 (2023) - [j28]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023) - [c53]Phoebe de Nooijer, Soeren Terziadis
Removing Popular Faces in Curve Arrangements. GD (2) 2023: 18-33 - [c52]Wouter Castelein, Zonglin Tian, Tamara Mchedlidze, Alexandru C. Telea:
Viewpoint-Based Quality for Analyzing and Exploring 3D Multidimensional Projections. VISIGRAPP (3: IVAPP) 2023: 65-76 - [c51]Simon van Wageningen
Identifying Cluttering Edges in Near-Planar Graphs. EuroVis (Short Papers) 2023: 85-89 - [i38]Simon van Wageningen, Tamara Mchedlidze, Alexandru C. Telea:
Identifying Cluttering Edges in Near-Planar Graphs. CoRR abs/2304.07274 (2023) - [i37]Gregor Betz, Vera Chekan, Tamara Mchedlidze:
Heuristic Algorithms for the Approximation of Mutual Coherence. CoRR abs/2307.01639 (2023) - 2022
- [j27]Guido Brückner
Level-Planar Drawings with Few Slopes. Algorithmica 84(1): 176-196 (2022) - [j26]Jonathan Klawitter, Tamara Mchedlidze:
Upward planar drawings with two slopes. J. Graph Algorithms Appl. 26(1): 171-198 (2022) - [j25]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann
On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022) - [c50]Michael A. Bekos
Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370 - [c49]Philipp Kindermann
Graph Drawing Contest Report. GD 2022: 459-470 - [c48]Tamara Mchedlidze
Metaphoric Maps for Dynamic Vertex-weighted Graphs. EuroVis (Short Papers) 2022: 37-41 - [i36]Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. CoRR abs/2202.12175 (2022) - [i35]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022) - [i34]Simon van Wageningen, Tamara Mchedlidze:
Can an NN model plainly learn planar layouts? CoRR abs/2209.01075 (2022) - 2021
- [j24]Jakob Geiger
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum 40(3): 471-481 (2021) - [c47]Philipp Kindermann
Graph Drawing Contest Report. GD 2021: 409-417 - [c46]Fabian Frank, Michael Kaufmann
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM 2021: 361-372 - [c45]Elena Arseneva
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [i33]Jonathan Klawitter, Tamara Mchedlidze:
Upward planar drawings with two slopes. CoRR abs/2106.02839 (2021) - 2020
- [j23]Tamara Mchedlidze
Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. 24(2): 105-131 (2020) - [c44]Patrizio Angelini
On Mixed Linear Layouts of Series-Parallel Graphs. GD 2020: 151-159 - [c43]Philipp Kindermann
Graph Drawing Contest Report. GD 2020: 507-519 - [i32]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR abs/2008.10475 (2020) - [i31]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. CoRR abs/2012.10525 (2020)
2010 – 2019
- 2019
- [j22]Gregor Betz, Michael Hamann
Applying argumentation to structure and visualize multi-dimensional opinion spaces. Argument Comput. 10(1): 23-40 (2019) - [j21]Tamara Mchedlidze
Aesthetic Discrimination of Graph Layouts. J. Graph Algorithms Appl. 23(3): 525-552 (2019) - [j20]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze
Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48(5): 1487-1502 (2019) - [j19]Patrizio Angelini
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [j18]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [c42]Carla Binucci
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [c41]Philipp Kindermann
Drawing Planar Graphs with Few Segments on a Polynomial Grid. GD 2019: 416-429 - [c40]Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze
Level-Planar Drawings with Few Slopes. GD 2019: 559-572 - [c39]Philipp Kindermann
Graph Drawing Contest Report. GD 2019: 575-583 - [c38]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze
Planar graphs of bounded degree have bounded queue number. STOC 2019: 176-184 - [c37]Tamara Mchedlidze
Drawing Clustered Graphs on Disk Arrangements. WALCOM 2019: 160-171 - [i30]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i29]Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
Drawing planar graphs with few segments on a polynomial grid. CoRR abs/1903.08496 (2019) - [i28]Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze:
Level-Planar Drawings with Few Slopes. CoRR abs/1907.13558 (2019) - 2018
- [j17]Patrizio Angelini
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j16]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j15]Tamara Mchedlidze
Aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 22(3): 401-429 (2018) - [j14]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1): 94-130 (2018) - [c36]Moritz Klammler, Tamara Mchedlidze
Aesthetic Discrimination of Graph Layouts. GD 2018: 169-184 - [c35]Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze
A Greedy Heuristic for Crossing-Angle Maximization. GD 2018: 286-299 - [c34]Tamara Mchedlidze
\beta -Stars or On Extending a Drawing of a Connected Subgraph. GD 2018: 416-429 - [c33]Patrizio Angelini
Greedy Rectilinear Drawings. GD 2018: 495-508 - [i27]Almut Demel, Dominik Dürrschnabel
A Greedy Heuristic for Crossing-Angle Maximization. CoRR abs/1807.09483 (2018) - [i26]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - [i25]Tamara Mchedlidze, Jérôme Urhausen:
β-Stars or On Extending a Drawing of a Connected Subgraph. CoRR abs/1808.10366 (2018) - [i24]Moritz Klammler, Tamara Mchedlidze, Alexey Pak:
Aesthetic Discrimination of Graph Layouts. CoRR abs/1809.01017 (2018) - [i23]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Graphs on Disk Arrangements. CoRR abs/1811.00785 (2018) - [i22]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree have Constant Queue Number. CoRR abs/1811.00816 (2018) - [i21]Katy Börner, Øyvind Eide, Tamara Mchedlidze, Malte Rehbein
Network Visualization in the Humanities (Dagstuhl Seminar 18482). Dagstuhl Reports 8(11): 139-153 (2018) - 2017
- [c32]Tamara Mchedlidze
Aligned Drawings of Planar Graphs. GD 2017: 3-16 - [c31]Jonathan Klawitter
Experimental Evaluation of Book Drawing Algorithms. GD 2017: 224-238 - [c30]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [i20]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. CoRR abs/1708.08778 (2017) - [i19]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. CoRR abs/1708.09221 (2017) - [i18]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017) - 2016
- [j13]Tamara Mchedlidze
Extending Convex Partial Drawings of Graphs. Algorithmica 76(1): 47-67 (2016) - [j12]Emilio Di Giacomo
Lower and upper bounds for long induced paths in 3-connected planar graphs. Theor. Comput. Sci. 636: 47-55 (2016) - [c29]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann
Strongly Monotone Drawings of Planar Graphs. SoCG 2016: 37:1-37:15 - [c28]Giordano Da Lozzo
Drawing Planar Graphs with Many Collinear Vertices. GD 2016: 152-165 - [c27]David Bremner, Olivier Devillers
Monotone Simultaneous Embeddings of Paths in d Dimensions. GD 2016: 546-553 - [i17]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. CoRR abs/1601.01598 (2016) - [i16]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. CoRR abs/1606.03890 (2016) - [i15]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - 2015
- [j11]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j10]Francesco Giordano, Giuseppe Liotta
Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms 30: 45-69 (2015) - [j9]Oswin Aichholzer
Monotone Simultaneous Embeddings of Upward Planar Digraphs. J. Graph Algorithms Appl. 19(1): 87-110 (2015) - [j8]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
Fitting Planar Graphs on Planar Maps. J. Graph Algorithms Appl. 19(1): 413-440 (2015) - [j7]Oswin Aichholzer
Embedding Four-directional Paths on Convex Point Sets. J. Graph Algorithms Appl. 19(2): 743-759 (2015) - [c26]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter
Operating Power Grids with Few Flow Control Buses. e-Energy 2015: 289-294 - [c25]Tamara Mchedlidze
Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI 2015: 192-199 - [c24]Patrizio Angelini
A Universal Point Set for 2-Outerplanar Graphs. GD 2015: 409-422 - [c23]Stephen G. Kobourov
Gestalt Principles in Graph Drawing. GD 2015: 558-560 - [i14]Tamara Mchedlidze:
Simultaneous straight-line drawing of a planar graph and its rectangular dual. CoRR abs/1505.02708 (2015) - [i13]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. CoRR abs/1505.05747 (2015) - [i12]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. CoRR abs/1508.05784 (2015) - 2014
- [j6]Tamara Mchedlidze
Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points. Comput. Geom. 47(3): 493-498 (2014) - [j5]Patrizio Angelini
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [j4]William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18(5): 721-739 (2014) - [c22]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze
Embedding Four-Directional Paths on Convex Point Sets. GD 2014: 355-366 - [c21]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
Fitting Planar Graphs on Planar Maps. SOFSEM 2014: 52-64 - [c20]Boris Klemz, Tamara Mchedlidze
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. SWAT 2014: 265-276 - [i11]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber:
Embedding Four-directional Paths on Convex Point Sets. CoRR abs/1408.4933 (2014) - 2013
- [j3]Michael Kaufmann, Tamara Mchedlidze
On upward point set embeddability. Comput. Geom. 46(6): 774-804 (2013) - [j2]Tamara Mchedlidze
Upward planar embedding of an n-vertex oriented path on O(n2) points. Comput. Geom. 46(8): 1003-1008 (2013) - [c19]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c18]Tamara Mchedlidze
Drawing Planar Graphs with a Prescribed Inner Face. GD 2013: 316-327 - [c17]Emilio Di Giacomo
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. WG 2013: 213-224 - [i10]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. CoRR abs/1308.3370 (2013) - [i9]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber:
Monotone Simultaneous Embedding of Directed Paths. CoRR abs/1310.6955 (2013) - [i8]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2012
- [c16]Fabrizio Frati
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - [c15]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - [c14]Martin Fink, Jan-Henrik Haunert
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. WALCOM 2012: 186-197 - [i7]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
How many vertex locations can be arbitrarily chosen when drawing planar graphs? CoRR abs/1212.0804 (2012) - 2011
- [j1]Tamara Mchedlidze
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. J. Graph Algorithms Appl. 15(3): 373-415 (2011) - [c13]Patrizio Angelini
Small Point Sets for Simply-Nested Planar Graphs. GD 2011: 75-85 - [c12]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. GD 2011: 379-390 - [c11]Michael Kaufmann, Tamara Mchedlidze
Upward Point Set Embeddability for Convex Point Sets Is in P. GD 2011: 403-414 - [c10]Martin Fink, Jan-Henrik Haunert
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. GD 2011: 441-442 - [c9]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze
Upward Point-Set Embeddability. SOFSEM 2011: 272-283 - [i6]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. CoRR abs/1107.4970 (2011) - [i5]Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point Set Embeddability for Convex Point Sets is in $P$. CoRR abs/1108.3092 (2011) - 2010
- [c8]Patrizio Angelini
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c7]Tamara Mchedlidze
Unilateral Orientation of Mixed Graphs. SOFSEM 2010: 588-599 - [i4]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point-Set Embeddability. CoRR abs/1010.5937 (2010)
2000 – 2009
- 2009
- [c6]Tamara Mchedlidze
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. COCOON 2009: 76-85 - [c5]Tamara Mchedlidze
On rho-Constrained Upward Topological Book Embeddings. GD 2009: 411-412 - [c4]Tamara Mchedlidze
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. ISAAC 2009: 882-891 - [c3]Tamara Mchedlidze
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. WALCOM 2009: 250-261 - [i3]Tamara Mchedlidze, Antonios Symvonis:
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. CoRR abs/0904.2129 (2009) - [i2]Tamara Mchedlidze, Antonios Symvonis:
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. CoRR abs/0909.2787 (2009) - 2008
- [c2]Tamara Mchedlidze
Spine Crossing Minimization in Upward Topological Book Embeddings. GD 2008: 445-446 - [i1]Tamara Mchedlidze, Antonios Symvonis:
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings). CoRR abs/0807.2330 (2008) - 2007
- [c1]Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze
Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ISAAC 2007: 172-183
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-11-27 20:32 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: