default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Satoru Iwata 0001
University of Tokyo, Department of Mathematical Informatics, Japan - Satoru Iwata 0002
Nagoya Institute of Technology, Japan - Satoru Iwata 0003
Tokyo University, Dept. of Eng. Synthesis, Japan
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 129 matches
- 2024
- Shinichi Hemmi, Satoru Iwata, Taihei Oki:
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method. CoRR abs/2409.13128 (2024) - 2023
- Satoru Iwata, Yu Yokoi:
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. SIAM J. Comput. 52(5): 1230-1268 (2023) - 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] - Satoru Iwata, Taihei Oki, Shinsaku Sakaue:
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. CoRR abs/2312.05470 (2023) - 2022
- Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. 51(2): 17-238 (2022) - Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS 2022 - 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
- Satoru Iwata:
A Pfaffian formula for matching polynomials of outerplanar graphs. Optim. Methods Softw. 36(2-3): 332-336 (2021) - 2020
- Satoru Iwata, Yu Yokoi:
Finding a Stable Allocation in Polymatroid Intersection. Math. Oper. Res. 45(1): 63-85 (2020) - Satoru Iwata, Yu Yokoi:
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths. SODA 2020: 1933-1944 - 2019
- Koyo Hayashi, Satoru Iwata:
Correction to: Counting Minimum Weight Arborescences. Algorithmica 81(1): 418 (2019) - Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM 66(5): 35:1-35:34 (2019) - Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. CoRR abs/1905.13371 (2019) - Satoru Iwata, Yu Yokoi:
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. CoRR abs/1909.07919 (2019) - 2018
- Koyo Hayashi, Satoru Iwata:
Counting Minimum Weight Arborescences. Algorithmica 80(12): 3908-3919 (2018) - Satoru Iwata, Yu Yokoi:
List Supermodular Coloring. Comb. 38(6): 1437-1456 (2018) - Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32(1): 560-590 (2018) - Satoru Iwata, Mizuyo Takamatsu:
Index Reduction via Unimodular Transformations. SIAM J. Matrix Anal. Appl. 39(3): 1135-1151 (2018) - Satoru Iwata, Tadachika Ozono, Toramatsu Shintani:
Developing a Management System and Interface for Instant Application Window Sharing. IIAI-AAI 2018: 883-888 - Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC 2018: 45-55 - 2017
- Satoru Iwata, Mizuyo Takamatsu:
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils. SIAM J. Control. Optim. 55(3): 2134-2150 (2017) - 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) - Satoru Iwata, Tadachika Ozono, Toramatsu Shintani:
Any-Application Window Sharing Mechanism Based on WebRTC. IIAI-AAI 2017: 808-813 - Satoru Iwata:
Weighted Linear Matroid Parity. ISAAC 2017: 1:1-1:5 - Kosuke Nishida, Akiko Takeda, Satoru Iwata, Mariko Kiho, Isao Nakayama:
Household energy consumption prediction by feature selection of lifestyle data. SmartGridComm 2017: 235-240 - Satoru Iwata, Yusuke Kobayashi:
A weighted linear matroid parity algorithm. STOC 2017: 264-276 - 2016
- Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended formulations for sparsity matroids. Math. Program. 158(1-2): 565-574 (2016) - Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata:
Solving Generalized CDT Problems via Two-Parameter Eigenvalues. SIAM J. Optim. 26(3): 1669-1694 (2016) - Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. SODA 2016: 404-413 - Satoru Iwata, Yu Yokoi:
Finding a Stable Allocation in Polymatroid Intersection. SODA 2016: 1034-1047
skipping 99 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-12-09 07:43 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint