default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoru Iwata 0001
Person information
- affiliation: University of Tokyo, Department of Mathematical Informatics, Japan
Other persons with the same name
- Satoru Iwata 0002 — Nagoya Institute of Technology, Japan
- Satoru Iwata 0003 — Tokyo University, Dept. of Eng. Synthesis, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i11]Shinichi Hemmi, Satoru Iwata, Taihei Oki:
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method. CoRR abs/2409.13128 (2024)- 2023
- [j70]Satoru Iwata
, Yu Yokoi:
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. SIAM J. Comput. 52(5): 1230-1268 (2023) - [e1]Satoru Iwata, Naonori Kakimura:
34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. LIPIcs 283, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-289-1 [contents] - [i10]Satoru Iwata, Taihei Oki, Shinsaku Sakaue:
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. CoRR abs/2312.05470 (2023) - 2022
- [j69]Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. 51(2): 17-238 (2022) - [c36]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS 2022 - [i9]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. CoRR abs/2206.05947 (2022) - 2021
- [j68]Satoru Iwata:
A Pfaffian formula for matching polynomials of outerplanar graphs. Optim. Methods Softw. 36(2-3): 332-336 (2021) - 2020
- [j67]Satoru Iwata, Yu Yokoi:
Finding a Stable Allocation in Polymatroid Intersection. Math. Oper. Res. 45(1): 63-85 (2020) - [c35]Satoru Iwata, Yu Yokoi:
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths. SODA 2020: 1933-1944
2010 – 2019
- 2019
- [j66]Koyo Hayashi, Satoru Iwata:
Correction to: Counting Minimum Weight Arborescences. Algorithmica 81(1): 418 (2019) - [j65]Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM 66(5): 35:1-35:34 (2019) - [i8]Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. CoRR abs/1905.13371 (2019) - [i7]Satoru Iwata, Yu Yokoi:
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. CoRR abs/1909.07919 (2019) - 2018
- [j64]Koyo Hayashi, Satoru Iwata:
Counting Minimum Weight Arborescences. Algorithmica 80(12): 3908-3919 (2018) - [j63]Satoru Iwata, Yu Yokoi:
List Supermodular Coloring. Comb. 38(6): 1437-1456 (2018) - [j62]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32(1): 560-590 (2018) - [j61]Satoru Iwata, Mizuyo Takamatsu:
Index Reduction via Unimodular Transformations. SIAM J. Matrix Anal. Appl. 39(3): 1135-1151 (2018) - [c34]Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC 2018: 45-55 - 2017
- [j60]Satoru Iwata, Mizuyo Takamatsu:
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils. SIAM J. Control. Optim. 55(3): 2134-2150 (2017) - [j59]Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. SIAM J. Optim. 27(1): 269-291 (2017) - [c33]Satoru Iwata:
Weighted Linear Matroid Parity. ISAAC 2017: 1:1-1:5 - [c32]Kosuke Nishida, Akiko Takeda, Satoru Iwata, Mariko Kiho, Isao Nakayama:
Household energy consumption prediction by feature selection of lifestyle data. SmartGridComm 2017: 235-240 - [c31]Satoru Iwata, Yusuke Kobayashi:
A weighted linear matroid parity algorithm. STOC 2017: 264-276 - 2016
- [j58]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended formulations for sparsity matroids. Math. Program. 158(1-2): 565-574 (2016) - [j57]Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata:
Solving Generalized CDT Problems via Two-Parameter Eigenvalues. SIAM J. Optim. 26(3): 1669-1694 (2016) - [c30]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. SODA 2016: 404-413 - [c29]Satoru Iwata, Yu Yokoi:
Finding a Stable Allocation in Polymatroid Intersection. SODA 2016: 1034-1047 - [i6]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible. CoRR abs/1612.08828 (2016) - 2015
- [j56]Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Computing the Signed Distance Between Overlapping Ellipsoids. SIAM J. Optim. 25(4): 2359-2384 (2015) - [j55]Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. IEEE Trans. Smart Grid 6(5): 2189-2199 (2015) - [i5]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. CoRR abs/1502.07406 (2015) - 2014
- [j54]Satoru Iwata, Tibor Jordán:
Orientations and detachments of graphs with prescribed degrees and connectivity. Discret. Optim. 12: 121-128 (2014) - [j53]Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh:
Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. J. Chem. Inf. Model. 54(4): 1027-1035 (2014) - [c28]Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Global Optimization Methods for Extended Fisher Discriminant Analysis. AISTATS 2014: 411-419 - [c27]Masashi Kitamura, Akiko Takeda, Satoru Iwata:
Exact SVM training by Wolfe's minimum norm point algorithm. MLSP 2014: 1-6 - [c26]Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber security analysis of power networks by hypergraph cut algorithms. SmartGridComm 2014: 824-829 - [c25]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. WG 2014: 312-323 - [i4]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended Formulations for Sparsity Matroids. CoRR abs/1403.7272 (2014) - [i3]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. CoRR abs/1407.2844 (2014) - 2013
- [j52]Satoru Iwata, Mizuyo Takamatsu:
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. Algorithmica 66(2): 346-368 (2013) - [j51]Satoru Iwata, R. Ravi:
Approximating max-min weighted T-joins. Oper. Res. Lett. 41(4): 321-324 (2013) - [j50]Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa:
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27(2): 918-939 (2013) - 2012
- [j49]Satoru Iwata, Mizuyo Takamatsu, Caren Tischendorf:
Tractability index of hybrid equations for circuit simulation. Math. Comput. 81(278): 923-939 (2012) - [j48]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
A flow model based on polylinking system. Math. Program. 135(1-2): 1-23 (2012) - [c24]Satoru Iwata, Prasad Tetali, Pushkar Tripathi:
Approximating Minimum Linear Ordering Problems. APPROX-RANDOM 2012: 206-217 - [c23]Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang:
Learning Valuation Functions. COLT 2012: 4.1-4.24 - 2011
- [j47]Satoru Iwata, Mizuyo Takamatsu:
On the Kronecker Canonical Form of Mixed Matrix Pencils. SIAM J. Matrix Anal. Appl. 32(1): 44-71 (2011) - [c22]Satoru Iwata, Mizuyo Takamatsu:
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. IPCO 2011: 274-286 - [i2]Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang:
Learning Valuation Functions. CoRR abs/1108.5669 (2011) - [i1]Satoru Iwata, Ken-ichi Kawarabayashi:
Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). NII Shonan Meet. Rep. 2011 (2011) - 2010
- [j46]Satoru Iwata, Yusuke Kobayashi:
An Algorithm for Minimum Cost Arc-Connectivity Orientations. Algorithmica 56(4): 437-447 (2010) - [j45]Mizuyo Takamatsu, Satoru Iwata:
Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation. Int. J. Circuit Theory Appl. 38(4): 419-440 (2010) - [j44]Satoru Iwata, Mizuyo Takamatsu:
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation. Math. Program. 121(1): 105-121 (2010) - [c21]Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata:
Minimum Average Cost Clustering. NIPS 2010: 1759-1767
2000 – 2009
- 2009
- [j43]Satoru Iwata, Mizuyo Takamatsu:
Computing the Degrees of All Cofactors in Mixed Polynomial Matrices. SIAM J. Discret. Math. 23(2): 647-660 (2009) - [c20]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
An algorithmic framework for wireless information flow. Allerton 2009: 294-300 - [c19]Satoru Iwata, Kiyohito Nagano:
Submodular Function Minimization under Covering Constraints. FOCS 2009: 671-680 - [c18]Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni:
Approximating submodular functions everywhere. SODA 2009: 535-544 - [c17]Satoru Iwata, James B. Orlin:
A simple combinatorial algorithm for submodular function minimization. SODA 2009: 1230-1237 - 2008
- [j42]Satoru Iwata, Takuro Matsuda:
Finding coherent cyclic orders in strong digraphs. Comb. 28(1): 83-88 (2008) - [j41]Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti:
Recent results on well-balanced orientations. Discret. Optim. 5(4): 663-676 (2008) - [j40]Satoru Iwata:
Submodular function minimization. Math. Program. 112(1): 45-64 (2008) - [j39]Satoru Iwata, Naonori Kakimura:
Solving linear programs from sign patterns. Math. Program. 114(2): 393-418 (2008) - [j38]Satoru Iwata, Kenjiro Takazawa:
The Independent Even Factor Problem. SIAM J. Discret. Math. 22(4): 1411-1427 (2008) - 2007
- [j37]Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh:
Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. J. Chem. Inf. Model. 47(5): 1734-1746 (2007) - [j36]Naonori Kakimura, Satoru Iwata:
Computing the inertia from sign patterns. Math. Program. 110(1): 229-244 (2007) - [c16]Toshinari Itoko, Satoru Iwata:
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. IPCO 2007: 267-279 - [c15]Satoru Iwata, Kenjiro Takazawa:
The independent even factor problem. SODA 2007: 1171-1180 - 2006
- [j35]Satoru Iwata, Ryo Shimizu:
Combinatorial Analysis of Singular Matrix Pencils. SIAM J. Matrix Anal. Appl. 29(1): 245-259 (2006) - 2005
- [j34]James F. Geelen, Satoru Iwata:
Matroid Matching Via Mixed Skew-Symmetric Matrices. Comb. 25(2): 187-215 (2005) - [j33]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103(1): 181-202 (2005) - [j32]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. 19(2): 304-320 (2005) - [j31]Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. SIAM J. Discret. Math. 19(4): 1065-1073 (2005) - [c14]Naonori Kakimura, Satoru Iwata:
Computing the Inertia from Sign Patterns. IPCO 2005: 236-248 - [c13]Satoru Iwata, Ryo Shimizu:
Combinatorial Analysis of Generic Matrix Pencils. IPCO 2005: 335-348 - 2004
- [j30]Satoru Iwata, Nozomu Zuiki:
A network flow approach to cost allocation for rooted trees. Networks 44(4): 297-301 (2004) - [j29]Tamás Fleiner, András Frank, Satoru Iwata:
A constrained independent set problem for matroids. Oper. Res. Lett. 32(1): 23-26 (2004) - [c12]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A Capacity Scaling Algorithm for M-convex Submodular Flow. IPCO 2004: 352-367 - 2003
- [j28]Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. Algorithmica 36(4): 331-341 (2003) - [j27]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. 23(3): 503-525 (2003) - [j26]Lisa Fleischer, Satoru Iwata:
A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131(2): 311-322 (2003) - [j25]James F. Geelen, Satoru Iwata, Kazuo Murota:
The linear delta-matroid parity problem. J. Comb. Theory B 88(2): 377-398 (2003) - [j24]Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions. SIAM J. Comput. 32(4): 833-840 (2003) - 2002
- [j23]Satoru Iwata:
On matroid intersection adjacency. Discret. Math. 242(1-3): 277-281 (2002) - [j22]Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42(1): 54-68 (2002) - [j21]Satoru Iwata:
A Fully Combinatorial Algorithm for Submodular Function Minimization. J. Comb. Theory B 84(2): 203-212 (2002) - [j20]Lisa Fleischer, Satoru Iwata, S. Thomas McCormick:
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92(1): 119-139 (2002) - [j19]Satoru Fujishige, Satoru Iwata:
A descent method for submodular function minimization. Math. Program. 92(2): 387-390 (2002) - [j18]Satoru Iwata, Maiko Shigeno:
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. SIAM J. Optim. 13(1): 204-211 (2002) - [c11]Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions. IPCO 2002: 1-8 - [c10]Satoru Iwata:
A fully combinatorial algorithm for submodular function minimization. SODA 2002: 915-919 - 2001
- [j17]Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4): 761-777 (2001) - [j16]Satoru Iwata, Kazuo Murota:
Combinatorial relaxation algorithm for mixed polynomial matrices. Math. Program. 90(2): 353-371 (2001) - [c9]Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. IPCO 2001: 160-169 - 2000
- [j15]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74(3-4): 123-128 (2000) - [j14]Maiko Shigeno, Satoru Iwata, S. Thomas McCormick:
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. 25(1): 76-104 (2000) - [c8]Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC 2000: 97-106 - [c7]Lisa Fleischer, Satoru Iwata:
Improved algorithms for submodular function minimization and submodular flow. STOC 2000: 107-116 - [c6]Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. SWAT 2000: 300-313
1990 – 1999
- 1999
- [j13]Satoru Fujishige, Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function. Discret. Appl. Math. 92(2-3): 211-215 (1999) - [c5]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO 1999: 259-272 - [c4]Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. SODA 1999: 476-483 - 1998
- [j12]Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998) - [c3]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Faster Algorithm for Minimum Cost Submodular Flows. SODA 1998: 167-174 - 1997
- [j11]Maiko Shigeno, Satoru Iwata:
A Cost-scaling Algorithm for 0-1 Submodular Flows. Discret. Appl. Math. 73(3): 261-273 (1997) - [j10]Satoru Iwata, Kazuo Murota, Maiko Shigeno:
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. Math. Oper. Res. 22(4): 803-813 (1997) - 1996
- [j9]Satoru Iwata:
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows. Comb. 16(3): 449 (1996) - [j8]Satoru Iwata:
A capacity scaling algorithm for convex cost submodular flows. Math. Program. 76: 299-308 (1996) - [j7]Satoru Iwata, Kazuo Murota:
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections. SIAM J. Discret. Math. 9(1): 71-86 (1996) - [j6]Satoru Iwata, Kazuo Murota, Izumi Sakuta:
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants. SIAM J. Sci. Comput. 17(4): 993-1012 (1996) - [c2]Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida:
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. COCOON 1996: 68-80 - [c1]Satoru Iwata:
A Capacity Scaling Algorithm for Convex Cost Submodular Flows. SODA 1996: 482-489 - 1995
- [j5]Satoru Iwata:
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows. Comb. 15(4): 515-532 (1995) - [j4]Satoru Iwata, Kazuo Murota:
A Theorem on the Principal Structure for Independent Matchings. Discret. Appl. Math. 61(3): 229-244 (1995) - [j3]Maiko Shigeno, Satoru Iwata:
A dual approximation approach to weighted matroid intersection. Oper. Res. Lett. 18(3): 153-156 (1995) - [j2]Satoru Iwata, Kazuo Murota:
A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices. SIAM J. Matrix Anal. Appl. 16(3): 719-734 (1995) - 1994
- [j1]Hisashi Ito, Satoru Iwata, Kazuo Murota:
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations. SIAM J. Matrix Anal. Appl. 15(4): 1226-1255 (1994)
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-10-18 19:31 CEST 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:
