default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDO-joung Kwon
Person information
- affiliation: Incheon National University, Department of Mathematics, South Korea
- affiliation (former): KAIST, Department of Mathematical Sciences, Daejeon, South Korea
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j41]Yeonsu Chang, Sejin Ko, O-joung Kwon, Myounghwan Lee:
A characterization of graphs of radius-r flip-width at most 2. Discret. Math. 348(4): 114366 (2025)- 2024
- [j40]Tony Huynh, O-joung Kwon
:
On the Erdős-Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs. SIAM J. Discret. Math. 38(1): 19-42 (2024) - [i37]Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin:
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs. CoRR abs/2408.09591 (2024) - 2023
- [j39]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85(10): 3058-3087 (2023) - [j38]Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan:
The Grid Theorem for vertex-minors. J. Comb. Theory B 158(Part): 93-116 (2023) - [j37]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum:
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k. J. Comb. Theory B 160: 15-35 (2023) - [c32]Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ISAAC 2023: 5:1-5:19 - [c31]Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie:
A half-integral Erdős-Pósa theorem for directed odd cycles. SODA 2023: 3043-3062 - [c30]Yeonsu Chang, O-joung Kwon, Myounghwan Lee:
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. WG 2023: 172-186 - [i36]Yeonsu Chang, O-joung Kwon, Myounghwan Lee:
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width. CoRR abs/2302.04624 (2023) - [i35]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing pivot-minors. CoRR abs/2311.04656 (2023) - 2022
- [j36]Jinha Kim, Minki Kim, O-joung Kwon:
Rainbow independent sets on dense graph classes. Discret. Appl. Math. 312: 45-51 (2022) - [j35]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs. Discret. Math. 345(10): 112985 (2022) - [c29]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. ITCS 2022: 63:1-63:23 - [c28]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
Directed Tangle Tree-Decompositions and Applications. SODA 2022: 377-405 - [c27]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of Intersection Digraphs with Good Algorithmic Properties. STACS 2022: 38:1-38:18 - [c26]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum:
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS 2022: 40:1-40:14 - [i34]Édouard Bonnet, O-joung Kwon, David R. Wood:
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR abs/2202.11858 (2022) - [i33]Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes. CoRR abs/2207.06660 (2022) - 2021
- [j34]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica 83(7): 2096-2141 (2021) - [j33]Jinha Kim, Minki Kim, O-joung Kwon:
A system of disjoint representatives of line segments with given k directions. Discret. Math. 344(12): 112621 (2021) - [j32]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121: 57-75 (2021) - [j31]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
A Menger-like property of tree-cut width. J. Comb. Theory B 148: 1-22 (2021) - [j30]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory B 149: 76-91 (2021) - [j29]O-joung Kwon, Sang-il Oum:
Graphs of bounded depth-2 rank-brittleness. J. Graph Theory 96(3): 361-378 (2021) - [j28]O-joung Kwon, Jean-Florent Raymond:
Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. 35(2): 597-636 (2021) - [j27]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35(4): 2922-2945 (2021) - [c25]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Three Problems on Well-Partitioned Chordal Graphs. CIAC 2021: 23-36 - [i32]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of intersection digraphs with good algorithmic properties. CoRR abs/2105.01413 (2021) - [i31]Tony Huynh, O-joung Kwon:
On the Erdős-Pósa property for long holes in C4-free graphs. CoRR abs/2105.11799 (2021) - [i30]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. CoRR abs/2109.14610 (2021) - 2020
- [j26]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 82(1): 118-145 (2020) - [j25]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82(6): 1654-1674 (2020) - [j24]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width I. Induced path problems. Discret. Appl. Math. 278: 153-168 (2020) - [j23]Minjeong Kang, O-joung Kwon, Myounghwan Lee:
Graphs without two vertex-disjoint S-cycles. Discret. Math. 343(10): 111997 (2020) - [j22]O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On low rank-width colorings. Eur. J. Comb. 83 (2020) - [j21]Matt DeVos, O-joung Kwon, Sang-il Oum:
Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. 90: 103186 (2020) - [j20]Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. J. Comb. Theory, Ser. B 140: 372-386 (2020) - [j19]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory B 145: 65-112 (2020) - [j18]O-joung Kwon, Sang-il Oum:
Scattered Classes of Graphs. SIAM J. Discret. Math. 34(1): 972-999 (2020) - [c24]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC 2020: 3:1-3:17 - [c23]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS 2020: 5:1-5:14 - [c22]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The Directed Flat Wall Theorem. SODA 2020: 239-258 - [c21]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG 2020: 148-160 - [i29]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR abs/2002.10859 (2020) - [i28]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR abs/2007.14179 (2020) - [i27]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Tree pivot-minors and linear rank-width. CoRR abs/2008.00561 (2020) - [i26]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR abs/2009.13184 (2020)
2010 – 2019
- 2019
- [j17]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81(10): 3890-3935 (2019) - [j16]Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan:
Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory B 135: 319-348 (2019) - [j15]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796: 216-236 (2019) - [c20]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS 2019: 42:1-42:15 - [c19]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS 2019: 32:1-32:14 - [i25]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR abs/1908.10132 (2019) - [i24]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. CoRR abs/1911.00230 (2019) - [i23]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A polynomial kernel for $3$-leaf power deletion. CoRR abs/1911.04249 (2019) - 2018
- [j14]Mamadou Moustapha Kanté, O-joung Kwon:
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. 74: 110-139 (2018) - [j13]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. 97: 121-146 (2018) - [c18]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC 2018: 6:1-6:14 - [c17]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. SODA 2018: 1665-1684 - [c16]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS 2018: 42:1-42:14 - [c15]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing Small Pivot-Minors. WG 2018: 125-138 - [p1]Stephan Kreutzer, O-joung Kwon:
Digraphs of Bounded Width. Classes of Directed Graphs 2018: 405-466 - [i22]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR abs/1803.03514 (2018) - [i21]O-joung Kwon, Jean-Florent Raymond:
Packing and covering induced subdivisions. CoRR abs/1803.07581 (2018) - [i20]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean tree-cut decompositions: obstructions and algorithms. CoRR abs/1808.00863 (2018) - [i19]Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR abs/1809.04278 (2018) - 2017
- [j12]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78(1): 342-377 (2017) - [j11]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica 79(1): 66-95 (2017) - [j10]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. Algorithmica 79(1): 251-270 (2017) - [j9]Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok:
Characterizing width two for variants of treewidth. Discret. Appl. Math. 216: 29-46 (2017) - [j8]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65: 154-167 (2017) - [j7]Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan:
Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. 61: 247-253 (2017) - [j6]Ilkyoo Choi, O-joung Kwon, Sang-il Oum:
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory B 123: 126-147 (2017) - [j5]Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
A width parameter useful for chordal and co-comparability graphs. Theor. Comput. Sci. 704: 1-17 (2017) - [c14]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - [c13]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC 2017: 7:1-7:13 - [c12]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC 2017: 21:1-21:13 - [c11]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS 2017: 121-132 - [c10]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS 2017: 509-520 - [c9]Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
A Width Parameter Useful for Chordal and Co-comparability Graphs. WALCOM 2017: 93-105 - [c8]O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On Low Rank-Width Colorings. WG 2017: 372-385 - [i18]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR abs/1702.06095 (2017) - [i17]O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On low rank-width colorings. CoRR abs/1703.03304 (2017) - [i16]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR abs/1704.06757 (2017) - [i15]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR abs/1708.04536 (2017) - [i14]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR abs/1710.07148 (2017) - [i13]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. CoRR abs/1711.00667 (2017) - [i12]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR abs/1711.05157 (2017) - 2016
- [j4]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and vertex-minors. Eur. J. Comb. 56: 46-56 (2016) - [c7]Eduard Eiben, Robert Ganian, O-joung Kwon:
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS 2016: 34:1-34:14 - [c6]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG 2016: 74-84 - [c5]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG 2016: 233-244 - [i11]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR abs/1603.05945 (2016) - [i10]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR abs/1604.06056 (2016) - [i9]Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Sim-width and induced minors. CoRR abs/1606.08087 (2016) - [i8]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR abs/1610.07229 (2016) - [i7]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR abs/1612.08197 (2016) - 2015
- [c4]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC 2015: 138-150 - [c3]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. IPEC 2015: 270-281 - [i6]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR abs/1504.05905 (2015) - [i5]Eun Jung Kim, O-joung Kwon:
A polynomial kernel for Block Graph Vertex Deletion. CoRR abs/1506.08477 (2015) - 2014
- [j3]O-joung Kwon, Sang-il Oum:
Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discret. Appl. Math. 168: 108-118 (2014) - [j2]O-joung Kwon, Sang-il Oum:
Unavoidable vertex-minors in large prime graphs. Eur. J. Comb. 41: 100-127 (2014) - [j1]Jisu Jeong, O-joung Kwon, Sang-il Oum:
Excluded vertex-minors for graphs of linear rank-width at most k. Eur. J. Comb. 41: 242-257 (2014) - [c2]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs. WG 2014: 42-55 - [i4]Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR abs/1403.1081 (2014) - [i3]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and Vertex-minors. CoRR abs/1403.7024 (2014) - [i2]Mamadou Moustapha Kanté, O-joung Kwon:
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR abs/1412.6201 (2014) - 2013
- [c1]Jisu Jeong, O-joung Kwon, Sang-il Oum:
Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221-232 - 2012
- [i1]O-joung Kwon, Sang-il Oum:
Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width. CoRR abs/1203.3606 (2012)
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-01-06 21:42 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:
