default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiro Ito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j57]Kyohei Chiba, Hiro Ito:
Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 131-141 (2022)- [c41]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104 - [i10]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR abs/2212.12450 (2022) - 2021
- [c40]Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow:
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG 2021: 377-387 - 2020
- [j56]Hiro Ito, Areej Khoury, Ilan Newman:
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. Comput. Complex. 29(1): 1 (2020) - [j55]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36(2): 181-203 (2020) - [j54]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
:
Cookie Clicker. Graphs Comb. 36(2): 269-302 (2020) - [j53]Hiro Ito:
Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. 28: 744 (2020) - [j52]Erik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura:
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. 28: 825-833 (2020) - [j51]Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi:
K3 Edge Cover Problem in a Wide Sense. J. Inf. Process. 28: 849-858 (2020) - [j50]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
FUN editorial. Theor. Comput. Sci. 842: 131 (2020)
2010 – 2019
- 2019
- [j49]Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, Eiji Oki:
Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. IEEE Access 7: 25422-25437 (2019) - [j48]Hiro Ito, Atsuki Nagao, Teagun Park:
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1126-1133 (2019) - [j47]James Andro-Vasko, Wolfgang W. Bein, Hiro Ito:
Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. Inf. 10(2): 44 (2019) - [j46]Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno:
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13(2): 99-100 (2019) - [j45]Hiro Ito:
What Graph Properties Are Constant-Time Testable? Rev. Socionetwork Strateg. 13(2): 101-121 (2019) - [j44]Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno:
Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. 13(2): 123-141 (2019) - [i9]Hiro Ito, Areej Khoury, Ilan Newman:
On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix. CoRR abs/1909.09984 (2019) - 2018
- [j43]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy pyramid folding. Comput. Geom. 75: 22-31 (2018) - [e4]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy. LIPIcs 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-067-5 [contents] - [i8]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao:
Cookie Clicker. CoRR abs/1808.07540 (2018) - 2017
- [j42]Hiro Ito:
Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. 25: 514 (2017) - [j41]Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara:
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. 25: 610-615 (2017) - [j40]Sergey Bereg, Hiro Ito:
Transforming Graphs with the Same Graphic Sequence. J. Inf. Process. 25: 627-633 (2017) - [j39]Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25: 667-677 (2017) - [i7]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CoRR abs/1708.06063 (2017) - 2016
- [j38]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36: 18-26 (2016) - [c39]Hiro Ito:
Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. ESA 2016: 51:1-51:12 - [c38]Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW 2016: 215-226 - [c37]Hiro Ito, Takahiro Ueda:
How to Solve the Cake-Cutting Problem in Sublinear Time. FUN 2016: 21:1-21:15 - [e3]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9943, Springer 2016, ISBN 978-3-319-48531-7 [contents] - [i6]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2015
- [j37]Yuichi Yoshida, Hiro Ito:
Testing Outerplanarity of Bounded Degree Graphs. Algorithmica 73(1): 1-20 (2015) - [j36]Hiro Ito:
Editor's Message for Special Issue on Recreational Discrete Mathematics. J. Inf. Process. 23(3): 238 (2015) - [j35]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. J. Inf. Process. 23(3): 265-271 (2015) - [j34]Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Generalized River Crossing Problems. Theory Comput. Syst. 56(2): 418-435 (2015) - [c36]James Andro-Vasko, Wolfgang Bein, Dara Nyknahad, Hiro Ito:
Evaluation of Online Power-Down Algorithms. ITNG 2015: 473-478 - [c35]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - [c34]Hiro Ito, Yoshinao Shiono:
Number of Ties and Undefeated Signs in a Generalized Janken. JCDCGG 2015: 143-154 - [c33]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - [i5]Hiro Ito:
Every property is testable on a natural class of scale-free multigraphs. CoRR abs/1504.00766 (2015) - [i4]Hiro Ito, Takahiro Ueda:
How to solve the cake-cutting problem in sublinear time. CoRR abs/1504.00774 (2015) - 2014
- [c32]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy Pyramid Folding. CCCG 2014 - [e2]Jin Akiyama, Hiro Ito, Toshinori Sakai:
Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8845, Springer 2014, ISBN 978-3-319-13286-0 [contents] - [i3]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. CoRR abs/1411.6371 (2014) - 2013
- [j33]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. Graphs Comb. 29(5): 1221-1234 (2013) - [j32]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3(2): 205-216 (2013) - [j31]Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi:
On computational complexity of graph inference from counting. Nat. Comput. 12(4): 589-603 (2013) - [j30]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto:
The complexity of the stamp folding problem. Theor. Comput. Sci. 497: 13-19 (2013) - [i2]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. CoRR abs/1306.4884 (2013) - 2012
- [j29]Yuichi Yoshida, Hiro Ito:
Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica 62(3-4): 701-712 (2012) - [j28]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41(4): 1074-1093 (2012) - [c31]Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Algorithms and Complexity of Generalized River Crossing Problems. FUN 2012: 235-244 - [c30]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC 2012: 407-413 - [c29]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. ICALP (1) 2012: 498-509 - [c28]Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida:
Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC 2012: 131-142 - [c27]Hiro Ito:
How to Generalize Janken - Rock-Paper-Scissors-King-Flea. TJJCCGG 2012: 85-94 - 2011
- [j27]Hiro Ito:
Preface. Graphs Comb. 27(3): 305-306 (2011) - [j26]Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs Comb. 27(3): 321-326 (2011) - [c26]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CCCG 2011 - [c25]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito:
Complexity of the Stamp Folding Problem. COCOA 2011: 311-321 - [c24]Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara:
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA 2011: 35-48 - [i1]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. CoRR abs/1103.2581 (2011) - 2010
- [j25]Yuichi Yoshida, Hiro Ito:
Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Trans. Inf. Syst. 93-D(2): 233-240 (2010) - [j24]Yuichi Yoshida, Hiro Ito:
Testing k-edge-connectivity of digraphs. J. Syst. Sci. Complex. 23(1): 91-101 (2010) - [c23]Yuichi Yoshida, Hiro Ito:
Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM 2010: 642-655 - [c22]Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens:
Making Polygons by Simple Folds and One Straight Cut. CGGA 2010: 27-43
2000 – 2009
- 2009
- [j23]Hiro Ito, Mike Paterson, Kenya Sugihara:
The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. 13(1): 55-73 (2009) - [j22]Kenya Sugihara, Hiro Ito:
Maximum-cover source location problems with objective edge-connectivity three. Math. Methods Oper. Res. 70(1): 183-193 (2009) - [j21]Hiro Ito, Kazuo Iwama:
Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5(4): 40:1-40:21 (2009) - [c21]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
An improved constant-time approximation algorithm for maximum matchings. STOC 2009: 225-234 - 2008
- [j20]Takeyuki Tamura, Hiro Ito:
Inferring Pedigree Graphs from Genetic Distances. IEICE Trans. Inf. Syst. 91-D(2): 162-169 (2008) - [c20]Yuichi Yoshida, Hiro Ito:
Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550 - [c19]Hiro Ito, Mike Paterson, Kenya Sugihara:
Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179 - [e1]Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno:
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, ISBN 978-3-540-89549-7 [contents] - 2007
- [j19]Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Semi-Distance Codes and Steiner Systems. Graphs Comb. 23(Supplement-1): 283-290 (2007) - [j18]Hiro Ito, Gisaku Nakamura, Satoshi Takata:
Winning Ways of Weighted Poset Games. Graphs Comb. 23(Supplement-1): 291-306 (2007) - [c18]Sergey Bereg, Hiro Ito:
Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32 - 2006
- [j17]Naoki Katoh, Hiro Ito:
Preface. Discret. Appl. Math. 154(16): 2239-2240 (2006) - [j16]Hiro Ito, Hiroshi Nagamochi:
Two equivalent measures on weighted hypergraphs. Discret. Appl. Math. 154(16): 2330-2334 (2006) - [j15]Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electron. Notes Discret. Math. 25: 165-171 (2006) - [j14]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Efficient Methods for Determining DNA Probe Orders. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1292-1298 (2006) - [j13]Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1370-1377 (2006) - 2005
- [j12]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005) - [c17]Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura:
Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9 - [c16]Hiro Ito:
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT 2005: 59-69 - [c15]Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi:
Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130 - 2004
- [j11]Akihiro Uejima, Hiro Ito:
Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. Electron. Notes Discret. Math. 17: 269-274 (2004) - [c14]Akihiro Uejima, Hiro Ito:
Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. CTW 2004: 232-236 - [c13]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292 - [c12]Hiro Ito:
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG 2004: 123-130 - 2003
- [j10]Hiro Ito:
Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. 24(1): 41-47 (2003) - [j9]Hiro Ito:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 977 (2003) - [j8]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003) - [j7]Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige:
Source location problem with flow requirements in directed networks. Optim. Methods Softw. 18(4): 427-435 (2003) - [c11]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177 - 2002
- [j6]Akihiro Uejima, Hiro Ito:
On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1026-1030 (2002) - [j5]Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama:
Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40(2): 63-70 (2002) - [c10]Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita:
File Transfer Tree Problems. ISAAC 2002: 441-452 - [c9]Hiro Ito, Hiroshi Nagamochi:
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181 - [c8]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210 - 2001
- [j4]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Lengths of tours and permutations on a vertex set of a convex polygon. Discret. Appl. Math. 115(1-3): 63-71 (2001) - [j3]Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito:
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80(6): 287-293 (2001) - 2000
- [c7]Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito:
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. ISAAC 2000: 338-349 - [c6]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG 2000: 160-166 - [c5]Hideyuki Uehara, Masato Fujihara, Mitsuo Yokoyama, Hiro Ito:
Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks. PIMRC 2000: 222-226
1990 – 1999
- 1998
- [j2]Hiro Ito, Mitsuo Yokoyama:
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. 66(4): 209-213 (1998) - [j1]Hiro Ito, Mitsuo Yokoyama:
Edge connectivity between nodes and node-subsets. Networks 31(3): 157-163 (1998) - [c4]Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu:
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC 1998: 149-158 - [c3]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG 1998: 129-157 - [c2]Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems. JCDCG 1998: 158-165 - 1994
- [c1]Takashi Satake, Hiro Ito, Akiya Inoue:
Network topology construction method and its support system. CAMAD 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-07-20 20:35 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:
