default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoyuki Kamiyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Kristóf Bérczi
, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024)- [c41]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. AAAI 2024: 9773-9780 - [i24]Naoyuki Kamiyama:
The Strongly Stable Matching Problem with Closures. CoRR abs/2401.02666 (2024) - [i23]Naoyuki Kamiyama:
Modifying an Instance of the Super-Stable Matching Problem. CoRR abs/2402.11918 (2024) - [i22]Naoyuki Kamiyama:
The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints. CoRR abs/2405.00342 (2024) - [i21]Naoyuki Kamiyama:
Non-uniformly Stable Matchings. CoRR abs/2408.16271 (2024) - 2023
- [j49]Naoyuki Kamiyama:
On optimization problems in acyclic hypergraphs. Inf. Process. Lett. 182: 106390 (2023) - [j48]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19(1): 6:1-6:22 (2023) - [j47]Naoyuki Kamiyama:
Pareto efficient matchings with pairwise preferences. Theor. Comput. Sci. 948: 113707 (2023) - [j46]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979: 114196 (2023) - [c40]Takasugu Shigenobu, Naoyuki Kamiyama:
On Connectedness of Solutions to Integer Linear Systems. COCOA (1) 2023: 421-433 - [c39]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto:
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP 2023: 82:1-82:17 - [c38]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [c37]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. WADS 2023: 533-546 - [i20]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto:
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR abs/2304.14782 (2023) - [i19]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. CoRR abs/2305.02059 (2023) - [i18]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - [i17]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. CoRR abs/2312.07241 (2023) - 2022
- [j45]Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44(Part): 100631 (2022) - [j44]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. 50(3): 370-375 (2022) - [j43]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36(2): 1102-1123 (2022) - [j42]Naoyuki Kamiyama:
A Matroid Generalization of the Super-Stable Matching Problem. SIAM J. Discret. Math. 36(2): 1467-1482 (2022) - [c36]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c35]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: 650-658 - [c34]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA 2022: 1342-1355 - [i16]Takashi Ishizuka, Naoyuki Kamiyama:
NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game. CoRR abs/2205.03117 (2022) - [i15]Takashi Ishizuka, Naoyuki Kamiyama:
On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games. CoRR abs/2207.01523 (2022) - [i14]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i13]Naoyuki Kamiyama:
Strongly Stable Matchings under Matroid Constraints. CoRR abs/2208.11272 (2022) - [i12]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments under Dichotomous Preferences. CoRR abs/2209.10262 (2022) - [i11]Naoyuki Kamiyama:
A Note on Robust Subsets of Transversal Matroids. CoRR abs/2210.09534 (2022) - 2021
- [j41]Naoyuki Kamiyama:
The envy-free matching problem with pairwise preferences. Inf. Process. Lett. 172: 106158 (2021) - [j40]Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong:
On the complexity of fair house allocation. Oper. Res. Lett. 49(4): 572-577 (2021) - [j39]Naoyuki Kamiyama:
Envy-free matchings with one-sided preferences and matroid constraints. Oper. Res. Lett. 49(5): 790-794 (2021) - [j38]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868: 30-45 (2021) - [c33]Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima:
MAS Network: Surrogate Neural Network for Multi-agent Simulation. MABS 2021: 113-124 - [c32]Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi:
Distributed Reconfiguration of Spanning Trees. SSS 2021: 516-520 - [i10]Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama:
Optimal class assignment problem: a case study at Gunma University. CoRR abs/2103.16879 (2021) - [i9]Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong:
On the Complexity of Fair House Allocation. CoRR abs/2106.06925 (2021) - [i8]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR abs/2110.11585 (2021) - 2020
- [j37]Naoyuki Kamiyama:
The Distance-Constrained Matroid Median Problem. Algorithmica 82(7): 2087-2106 (2020) - [j36]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. Discret. Appl. Math. 283: 565-576 (2020) - [j35]Naoyuki Kamiyama:
Lexicographically optimal earliest arrival flows. Networks 75(1): 18-33 (2020) - [j34]Naoyuki Kamiyama:
Popular matchings with two-sided preference lists and matroid constraints. Theor. Comput. Sci. 809: 265-276 (2020) - [c31]Naoyuki Kamiyama:
On Stable Matchings with Pairwise Preferences and Matroid Constraints. AAMAS 2020: 584-592 - [c30]Hiroaki Yamada, Naoyuki Kamiyama:
An Information Distribution Method for Avoiding Hunting Phenomenon in Theme Parks. AAMAS 2020: 2050-2052 - [c29]Hiroaki Yamada, Naoyuki Kamiyama:
Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions. PRIMA 2020: 299-314 - [i7]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR abs/2006.04428 (2020) - [i6]Naoyuki Kamiyama:
A Matroid Generalization of the Super-Stable Matching Problem. CoRR abs/2010.03820 (2020)
2010 – 2019
- 2019
- [j33]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81(1): 343-366 (2019) - [j32]Naoyuki Kamiyama:
A note on balanced flows in equality networks. Inf. Process. Lett. 145: 74-76 (2019) - [j31]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37(2): 454-464 (2019) - [j30]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177(1-2): 85-112 (2019) - [j29]Susumu Kawanaka, Naoyuki Kamiyama:
An improved algorithm for testing substitutability of weak preferences. Math. Soc. Sci. 99: 1-4 (2019) - [j28]Naoyuki Kamiyama:
Pareto Stable Matchings under One-Sided Matroid Constraints. SIAM J. Discret. Math. 33(3): 1431-1451 (2019) - [j27]Naoyuki Kamiyama:
Discrete Newton methods for the evacuation problem. Theor. Comput. Sci. 795: 510-519 (2019) - [c28]Naoyuki Kamiyama:
Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. AAMAS 2019: 583-591 - [c27]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for Gerrymandering over Graphs. AAMAS 2019: 1413-1421 - [c26]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA 2019: 61:1-61:15 - [i5]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR abs/1907.01700 (2019) - 2018
- [j26]Naoyuki Kamiyama:
A Note on Submodular Function Minimization with Covering Type Linear Constraints. Algorithmica 80(10): 2957-2971 (2018) - [j25]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The mixed evacuation problem. J. Comb. Optim. 36(4): 1299-1314 (2018) - [c25]Takashi Ishizuka, Naoyuki Kamiyama:
On the Complexity of Stable Fractional Hypergraph Matching. ISAAC 2018: 11:1-11:12 - [c24]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-Branching Problem in Digraphs. MFCS 2018: 12:1-12:15 - [i4]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. CoRR abs/1802.02381 (2018) - 2017
- [j24]Naoyuki Kamiyama:
Strategic issues in college admissions with score-limits. Oper. Res. Lett. 45(2): 105-108 (2017) - [j23]Naoyuki Kamiyama:
Popular Matchings with Ties and Matroid Constraints. SIAM J. Discret. Math. 31(3): 1801-1819 (2017) - [j22]Naoyuki Kamiyama:
A note on the submodular vertex cover problem with submodular penalties. Theor. Comput. Sci. 659: 95-97 (2017) - [j21]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677: 69-82 (2017) - [c23]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada:
Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD 2017: 41-55 - [c22]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON 2017: 287-296 - [c21]Hiroaki Yamada, Kotaro Ohori, Tadashige Iwao, Akifumi Kira, Naoyuki Kamiyama, Hiroaki Yoshida, Hirokazu Anai:
Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan. SocInfo (2) 2017: 419-430 - [c20]Naoyuki Kamiyama:
Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. WAOA 2017: 90-101 - 2016
- [j20]Naoyuki Kamiyama:
The popular matching and condensation problems under matroid constraints. J. Comb. Optim. 32(4): 1305-1326 (2016) - [j19]Tamás Fleiner, Naoyuki Kamiyama:
A Matroid Approach to Stable Matchings with Lower Quotas. Math. Oper. Res. 41(2): 734-744 (2016) - [j18]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended formulations for sparsity matroids. Math. Program. 158(1-2): 565-574 (2016) - [c19]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient Stabilization of Cooperative Matching Games. AAMAS 2016: 41-49 - [c18]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The Mixed Evacuation Problem. COCOA 2016: 18-32 - [c17]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA 2016: 430-444 - 2015
- [j17]Naoyuki Kamiyama, Yasushi Kawase:
On packing arborescences in temporal networks. Inf. Process. Lett. 115(2): 321-325 (2015) - [j16]Naoyuki Kamiyama:
The nucleolus of arborescence games in directed acyclic graphs. Oper. Res. Lett. 43(1): 89-92 (2015) - [c16]Naoyuki Kamiyama:
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. SAGT 2015: 3-14 - 2014
- [j15]Naoyuki Kamiyama, Naoki Katoh:
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. 178: 89-100 (2014) - [j14]Naoyuki Kamiyama:
A New Approach to the Pareto Stable Matching Problem. Math. Oper. Res. 39(3): 851-862 (2014) - [j13]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama:
An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. 556: 2-12 (2014) - [c15]Naoyuki Kamiyama:
The Popular Matching and Condensation Problems Under Matroid Constraints. COCOA 2014: 713-728 - [c14]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC 2014: 195-207 - [i3]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended Formulations for Sparsity Matroids. CoRR abs/1403.7272 (2014) - 2013
- [j12]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
On Total Unimodularity of Edge-Edge Adjacency Matrices. Algorithmica 67(2): 277-292 (2013) - [j11]András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh:
Independent arborescences in directed graphs. Discret. Math. 313(4): 453-459 (2013) - [j10]Naoyuki Kamiyama:
A note on the serial dictatorship with project closures. Oper. Res. Lett. 41(5): 559-561 (2013) - [c13]Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi:
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA 2013: 165-177 - 2012
- [j9]Satoru Fujishige, Naoyuki Kamiyama:
The root location problem for arc-disjoint arborescences. Discret. Appl. Math. 160(13-14): 1964-1970 (2012) - [c12]Tamás Fleiner, Naoyuki Kamiyama:
A matroid approach to stable matchings with lower quotas. SODA 2012: 135-142 - 2011
- [j8]Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui:
Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Trans. Inf. Syst. 94-D(2): 196-199 (2011) - [j7]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. Inf. Process. Lett. 111(10): 465-468 (2011) - [j6]Naoyuki Kamiyama, Naoki Katoh:
Covering directed graphs by in-trees. J. Comb. Optim. 21(1): 2-18 (2011) - [c11]Naoyuki Kamiyama, Tomomi Matsui:
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS 2011: 137-144 - [c10]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
On Totally Unimodularity of Edge-Edge Adjacency Matrices. COCOON 2011: 354-365 - [c9]Naoyuki Kamiyama:
Robustness of Minimum Cost Arborescences. ISAAC 2011: 130-139 - [c8]Naoyuki Kamiyama:
Submodular Function Minimization under a Submodular Set Covering Constraint. TAMC 2011: 133-141 - 2010
- [c7]Naoyuki Kamiyama:
The Prize-Collecting Edge Dominating Set Problem in Trees. MFCS 2010: 465-476 - [i2]Naoyuki Kamiyama:
A Relation between the Protocol Partition Number and the Quasi-Additive Bound. CoRR abs/1012.5130 (2010)
2000 – 2009
- 2009
- [j5]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. Comb. 29(2): 197-214 (2009) - [j4]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. 157(17): 3665-3677 (2009) - [j3]Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka:
Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. 92-D(2): 130-140 (2009) - [j2]Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama:
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Inf. Process. Lett. 109(23-24): 1227-1231 (2009) - [c6]Naoyuki Kamiyama, Naoki Katoh:
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC 2009: 802-811 - 2008
- [c5]Naoyuki Kamiyama, Naoki Katoh:
Covering Directed Graphs by In-Trees. COCOON 2008: 444-457 - [c4]Naoyuki Kamiyama, Naoki Katoh:
The Minimum Weight In-Tree Cover Problem. MCO 2008: 155-164 - [c3]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. SODA 2008: 518-526 - [i1]Naoyuki Kamiyama, Naoki Katoh:
Covering Directed Graphs by In-trees. CoRR abs/0802.2755 (2008) - 2007
- [c2]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM 2007: 178-190 - 2006
- [j1]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Trans. Inf. Syst. 89-D(8): 2372-2379 (2006) - [c1]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM 2006: 231-242
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-07 21:22 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:
