default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSang-il Oum
Person information
- affiliation: Institute for Basic Science (IBS), Daejeon, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2026
[j78]Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, Sang-il Oum:
Fragile minor-monotone parameters under a random edge perturbation. Eur. J. Comb. 133: 104305 (2026)- [j77]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum
:
Reuniting χ-boundedness with polynomial χ-boundedness. J. Comb. Theory B 176: 30-73 (2026) - [c17]Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht:
The Erdős-Pósa property for circle graphs as vertex-minors. SODA 2026: 4930-4952 - [i22]Tuukka Korhonen, Sang-il Oum:
Branch-width of connectivity functions is fixed-parameter tractable. CoRR abs/2601.04756 (2026) - 2025
- [j76]Jochen Pascal Gollin, Kevin Hendrey, Sang-il Oum, Bruce Reed:
Linear Bounds on Treewidth in Terms of Excluded Planar Minors. Electron. J. Comb. 32(4) (2025) - [j75]Jungho Ahn, Seonghyuk Im, Sang-il Oum:
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs. Discret. Appl. Math. 377: 10-17 (2025) - [j74]Donggyu Kim, Sang-il Oum:
Note on Hamiltonicity of Basis Graphs of Even Delta-Matroids. J. Graph Theory 109(4): 446-453 (2025) - [j73]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum:
Twin-Width of Subdivisions of Multigraphs. SIAM J. Discret. Math. 39(2): 783-833 (2025) - [j72]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory 17(3): 18:1-18:42 (2025) - [c16]Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum:
Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. LICS 2025: 678-690 - 2024
- [j71]Donggyu Kim, Sang-il Oum:
Vertex-minors of graphs: A survey. Discret. Appl. Math. 351: 54-73 (2024) - [j70]Donggyu Kim, Sang-il Oum:
Prime vertex-minors of a prime graph. Eur. J. Comb. 118: 103871 (2024) - [j69]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Twin-width of random graphs. Random Struct. Algorithms 65(4): 794-831 (2024) - [i21]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum, Jane Tan:
Colouring t-perfect graphs. CoRR abs/2412.17735 (2024) - 2023
- [j68]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85(10): 3058-3087 (2023) - [j67]Donggyu Kim, Duksang Lee, Sang-il Oum:
Γ-Graphic Delta-Matroids and Their Applications. Comb. 43(5): 963-983 (2023) - [j66]Sang-il Oum:
Rank connectivity and pivot-minors of graphs. Eur. J. Comb. 108: 103634 (2023) - [j65]Duksang Lee, Sang-il Oum:
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. Eur. J. Comb. 113: 103761 (2023) - [j64]Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum:
Independent domination of graphs with bounded maximum degree. J. Comb. Theory B 158(Part): 341-352 (2023) - [j63]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) - [j62]Duksang Lee, Sang-il Oum:
Intertwining Connectivities for Vertex-Minors and Pivot-Minors. SIAM J. Discret. Math. 37(1): 304-314 (2023) - [c15]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [i20]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum:
Twin-width of subdivisions of multigraphs. CoRR abs/2306.05334 (2023) - [i19]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i18]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum:
Reuniting χ-boundedness with polynomial χ-boundedness. CoRR abs/2310.11167 (2023) - [i17]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
- [j61]Ringi Kim, Sergey Norin, Sang-il Oum:
Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. 312: 15-28 (2022) - [j60]Duksang Lee, Sang-il Oum:
Characterizing matroids whose bases form graphic delta-matroids. Eur. J. Comb. 101: 103476 (2022) - [j59]Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu:
3-Degenerate induced subgraph of a planar graph. J. Graph Theory 99(2): 251-277 (2022) - [j58]Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Bounds for the Twin-Width of Graphs. SIAM J. Discret. Math. 36(3): 2352-2366 (2022) - [c14]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 - [i16]Jungho Ahn, Seonghyuk Im, Sang-il Oum:
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. CoRR abs/2208.08330 (2022) - [i15]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Twin-width of random graphs. CoRR abs/2212.07880 (2022) - 2021
- [j57]Jaehoon Kim, Sang-il Oum:
The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor. Electron. J. Comb. 28(2): 2 (2021) - [j56]Ringi Kim, Sang-il Oum, Xin Zhang:
Equitable partition of planar graphs. Discret. Math. 344(6): 112351 (2021) - [j55]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) - [j54]O-joung Kwon, Sang-il Oum:
Graphs of bounded depth-2 rank-brittleness. J. Graph Theory 96(3): 361-378 (2021) - [j53]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. 35(4): 2544-2617 (2021) - [j52]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) - [c13]Donggyu Kim, Duksang Lee, Sang-il Oum:
Γ-Graphic Delta-Matroids and Their Applications. ISAAC 2021: 70:1-70:13 - [i14]Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Bounds for the Twin-width of Graphs. CoRR abs/2110.03957 (2021) - 2020
- [j51]Huy-Trung Nguyen, Sang-il Oum:
The average cut-rank of graphs. Eur. J. Comb. 90: 103183 (2020) - [j50]Matt DeVos, O-joung Kwon, Sang-il Oum:
Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. 90: 103186 (2020) - [j49]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) - [j48]O-joung Kwon, Sang-il Oum:
Scattered Classes of Graphs. SIAM J. Discret. Math. 34(1): 972-999 (2020) - [c12]Sang-il Oum:
How to Decompose a Graph into a Tree-Like Structure (Invited Talk). ISAAC 2020: 1:1-1:1 - [c11]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS 2020: 5:1-5:14 - [i13]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)
2010 – 2019
- 2019
- [j47]Patrice Ossona de Mendez, Sang-il Oum, David R. Wood:
Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. 39(2): 377-410 (2019) - [j46]Reinhard Diestel, Sang-il Oum:
Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. 39(4): 879-910 (2019) - [j45]Dong Yeap Kang, Sang-il Oum:
Improper colouring of graphs with no odd clique minor. Comb. Probab. Comput. 28(5): 740-754 (2019) - [j44]Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum:
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. Discret. Appl. Math. 257: 60-66 (2019) - [j43]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) - [j42]Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum:
Online Ramsey theory for a triangle on -free graphs. J. Graph Theory 92(2): 152-171 (2019) - [i12]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. CoRR abs/1911.00230 (2019) - [i11]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A polynomial kernel for $3$-leaf power deletion. CoRR abs/1911.04249 (2019) - 2018
- [j41]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - [j40]Sang-il Oum, Sounggun Wee:
A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein. Comb. 38(5): 1279-1284 (2018) - [j39]Derek G. Corneil, Sang-il Oum, Christophe Paul:
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. 248: 1-2 (2018) - [j38]Maria Chudnovsky, Sang-il Oum:
Vertex-minors and the Erdős-Hajnal conjecture. Discret. Math. 341(12): 3498-3499 (2018) - [j37]Chun-Hung Liu, Sang-il Oum:
Partitioning H-minor free graphs into three subgraphs with no large components. J. Comb. Theory B 128: 114-133 (2018) - [j36]Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum:
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. SIAM J. Discret. Math. 32(2): 1209-1228 (2018) - [c10]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP 2018: 80:1-80:14 - [c9]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 - [i10]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
- [j35]Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood:
Majority Colourings of Digraphs. Electron. J. Comb. 24(2): 2 (2017) - [j34]Sang-il Oum:
Rank-width: Algorithmic and structural results. Discret. Appl. Math. 231: 15-24 (2017) - [j33]Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi:
Even-cycle decompositions of graphs with no odd-K4-minor. Eur. J. Comb. 65: 1-14 (2017) - [j32]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) - [j31]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) - [j30]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly Even-Cycle Decomposable Graphs. J. Graph Theory 84(2): 158-175 (2017) - [j29]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory 63(11): 7178-7205 (2017) - [i9]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding branch-decompositions of matroids, hypergraphs, and more. CoRR abs/1711.01381 (2017) - 2016
- [j28]Younjin Kim, Sangjune Lee, Sang-il Oum:
Dynamic coloring of graphs having no K5 minor. Discret. Appl. Math. 206: 81-89 (2016) - [j27]Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour:
Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B 118: 1-12 (2016) - [c8]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Constructive algorithm for path-width of matroids. SODA 2016: 1695-1704 - [i8]Sang-il Oum:
Rank-width: Algorithmic and structural results. CoRR abs/1601.03800 (2016) - [i7]Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum:
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. CoRR abs/1607.06864 (2016) - 2015
- [j26]Chun-Hung Liu, Sang-il Oum:
Partitioning H-minor free graphs into three subgraphs with no large components. Electron. Notes Discret. Math. 49: 133-138 (2015) - [j25]Choongbum Lee, Sang-il Oum:
Number of Cliques in Graphs with a Forbidden Subdivision. SIAM J. Discret. Math. 29(4): 1999-2005 (2015) - [j24]Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour:
A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. 29(4): 2385-2388 (2015) - [c7]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [i6]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Constructive algorithm for path-width of matroids. CoRR abs/1507.02184 (2015) - [i5]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - 2014
- [j23]Pinar Heggernes, Jan Kratochvíl, Sang-il Oum:
Guest editors' foreword. Discret. Appl. Math. 168: 1-2 (2014) - [j22]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) - [j21]O-joung Kwon, Sang-il Oum:
Unavoidable vertex-minors in large prime graphs. Eur. J. Comb. 41: 100-127 (2014) - [j20]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) - [j19]Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle:
Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. 535: 16-24 (2014) - [c6]Reinhard Diestel, Sang-il Oum:
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). WG 2014: 1-14 - 2013
- [c5]Jisu Jeong, O-joung Kwon, Sang-il Oum:
Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221-232 - [i4]Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle:
Faster Algorithms Parameterized by Clique-width. CoRR abs/1311.0224 (2013) - 2012
- [j18]Maria Chudnovsky, Sang-il Oum, Paul D. Seymour:
Finding minimum clique capacity. Comb. 32(3): 283-287 (2012) - [j17]Choongbum Lee, Joonkyung Lee, Sang-il Oum:
Rank-width of random graphs. J. Graph Theory 70(3): 339-347 (2012) - [c4]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding First Order Properties of Matroids. ICALP (2) 2012: 239-250 - [i3]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) - [i2]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly even cycle decomposable graphs. CoRR abs/1209.0160 (2012) - 2011
- [j16]Sang-il Oum:
Perfect Matchings in Claw-free Cubic Graphs. Electron. J. Comb. 18(1) (2011) - [j15]Sang-il Oum:
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). Electron. Notes Discret. Math. 38: 693-698 (2011) - [i1]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding first order logic properties of matroids. CoRR abs/1108.5457 (2011) - 2010
- [j14]Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos:
Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31(7): 1617-1628 (2010)
2000 – 2009
- 2009
- [j13]Sang-il Oum:
Computing rank-width exactly. Inf. Process. Lett. 109(13): 745-748 (2009) - [j12]Sang-il Oum:
Excluding a bipartite circle graph from line graphs. J. Graph Theory 60(3): 183-203 (2009) - [j11]Jim Geelen, Sang-il Oum:
Circle graph obstructions under pivoting. J. Graph Theory 61(1): 1-11 (2009) - 2008
- [j10]Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008) - [j9]Sang-il Oum:
Rank-width is less than or equal to branch-width. J. Graph Theory 57(3): 239-244 (2008) - [j8]Petr Hlinený, Sang-il Oum:
Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. 38(3): 1012-1032 (2008) - [j7]Sang-il Oum:
Rank-Width and Well-Quasi-Ordering. SIAM J. Discret. Math. 22(2): 666-682 (2008) - [j6]Sang-il Oum:
Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5(1): 10:1-10:20 (2008) - 2007
- [j5]Bruno Courcelle, Sang-il Oum:
Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory B 97(1): 91-126 (2007) - [j4]Sang-il Oum, Paul D. Seymour:
Testing branch-width. J. Comb. Theory B 97(3): 385-393 (2007) - [c3]Petr Hlinený, Sang-il Oum:
Finding Branch-Decompositions and Rank-Decompositions. ESA 2007: 163-174 - 2006
- [j3]Sang-il Oum, Paul D. Seymour:
Approximating clique-width and branch-width. J. Comb. Theory B 96(4): 514-528 (2006) - [c2]Sang-il Oum, Paul D. Seymour:
Certifying large branch-width. SODA 2006: 810-813 - 2005
- [j2]Sang-il Oum:
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). Electron. Notes Discret. Math. 22: 281-285 (2005) - [j1]Sang-il Oum:
Rank-width and vertex-minors. J. Comb. Theory B 95(1): 79-100 (2005) - [c1]Sang-il Oum:
Approximating Rank-Width and Clique-Width Quickly. WG 2005: 49-58
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 2026-02-27 23: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:
