Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDTamara Mchedlidze
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j23]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
, Nina Zimbel:
Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. 24(2): 105-131 (2020)- [i31]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR abs/2008.10475 (2020)
2010 – 2019
- 2019
- [j22]Gregor Betz, Michael Hamann, Tamara Mchedlidze, Sophie von Schmettow:
Applying argumentation to structure and visualize multi-dimensional opinion spaces. Argument Comput. 10(1): 23-40 (2019) - [j21]Tamara Mchedlidze, Alexey Pak, Moritz Klammler:
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, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48(5): 1487-1502 (2019) - [j19]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [j18]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [c42]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. Symposium on Computational Geometry 2019: 13:1-13:22 - [c41]Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
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, Tamara Mchedlidze, Ignaz Rutter:
Graph Drawing Contest Report. GD 2019: 575-583 - [c38]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar graphs of bounded degree have bounded queue number. STOC 2019: 176-184 - [c37]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
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, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
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, Marcel Radermacher, Ignaz Rutter:
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, Alexey Pak:
Aesthetic Discrimination of Graph Layouts. Graph Drawing 2018: 169-184 - [c35]Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf:
A Greedy Heuristic for Crossing-Angle Maximization. Graph Drawing 2018: 286-299 - [c34]Tamara Mchedlidze, Jérôme Urhausen:
\beta -Stars or On Extending a Drawing of a Connected Subgraph. Graph Drawing 2018: 416-429 - [c33]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. Graph Drawing 2018: 495-508 - [i27]Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf:
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, Gerik Scheuermann:
Network Visualization in the Humanities (Dagstuhl Seminar 18482). Dagstuhl Reports 8(11): 139-153 (2018) - 2017
- [c32]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. Graph Drawing 2017: 3-16 - [c31]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. Graph Drawing 2017: 224-238 - [c30]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. Graph Drawing 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, Martin Nöllenburg, Ignaz Rutter:
Extending Convex Partial Drawings of Graphs. Algorithmica 76(1): 47-67 (2016) - [j12]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
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, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. Symposium on Computational Geometry 2016: 37:1-37:15 - [c28]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. Graph Drawing 2016: 152-165 - [c27]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in d Dimensions. Graph Drawing 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, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j10]Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis, Sue Whitesides:
Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms 30: 45-69 (2015) - [j9]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber:
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, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. J. Graph Algorithms Appl. 19(1): 413-440 (2015) - [j7]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber:
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, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. e-Energy 2015: 289-294 - [c25]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI 2015: 192-199 - [c24]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. Graph Drawing 2015: 409-422 - [c23]Stephen G. Kobourov, Tamara Mchedlidze, Laura Vonessen:
Gestalt Principles in Graph Drawing. Graph Drawing 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, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
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 Lenhart, Tamara Mchedlidze, Stephen K. Wismath:
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, Birgit Vogtenhuber:
Embedding Four-Directional Paths on Convex Point Sets. Graph Drawing 2014: 355-366 - [c21]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. SOFSEM 2014: 52-64 - [c20]Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg:
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, Antonios Symvonis:
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, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. Graph Drawing 2013: 316-327 - [c17]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
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 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, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. Graph Drawing 2012: 291-302 - [c15]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - [c14]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
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, Antonios Symvonis:
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. J. Graph Algorithms Appl. 15(3): 373-415 (2011) - [c13]Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Point Sets for Simply-Nested Planar Graphs. Graph Drawing 2011: 75-85 - [c12]Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. Graph Drawing 2011: 379-390 - [c11]Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point Set Embeddability for Convex Point Sets Is in P. Graph Drawing 2011: 403-414 - [c10]Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff:
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Graph Drawing 2011: 441-442 - [c9]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
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, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Geometric Graph Embeddings into Point Sets. Graph Drawing 2010: 25-37 - [c7]Tamara Mchedlidze, Antonios Symvonis:
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, Antonios Symvonis:
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. COCOON 2009: 76-85 - [c5]Tamara Mchedlidze, Antonios Symvonis:
On rho-Constrained Upward Topological Book Embeddings. Graph Drawing 2009: 411-412 - [c4]Tamara Mchedlidze, Antonios Symvonis:
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. ISAAC 2009: 882-891 - [c3]Tamara Mchedlidze, Antonios Symvonis:
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, Antonios Symvonis:
Spine Crossing Minimization in Upward Topological Book Embeddings. Graph Drawing 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, Antonios Symvonis:
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-09-12 00:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
