![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
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 91 matches
- 2024
- Tsubasa Harada, Toshiya Itoh:
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem. CoRR abs/2406.03778 (2024) - 2023
- Steven Ge
, Toshiya Itoh
:
Popularity on the Roommate Diversity Problem. COCOA (1) 2023: 316-329 - Tsubasa Harada
, Toshiya Itoh
:
Online Facility Assignment for General Layout of Servers on a Line. COCOA (2) 2023: 310-322 - Tsubasa Harada, Toshiya Itoh:
Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line. CoRR abs/2308.05933 (2023) - Steven Ge, Toshiya Itoh:
Popularity on the 3D-Euclidean Stable Roommates. CoRR abs/2311.10585 (2023) - 2022
- Suthee Ruangwises
, Toshiya Itoh:
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. FUN 2022: 24:1-24:12 - Steven Ge
, Toshiya Itoh
:
Characterization of the Imbalance Problem on Complete Bipartite Graphs. TAMC 2022: 55-66 - Suthee Ruangwises
, Toshiya Itoh
:
Physical ZKP for Makaro Using a Standard Deck of Cards. TAMC 2022: 43-54 - Suthee Ruangwises, Toshiya Itoh:
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. CoRR abs/2202.09788 (2022) - Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki:
Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line. CoRR abs/2207.05308 (2022) - Steven Ge, Toshiya Itoh:
Popularity on the Roommate Diversity Problem. CoRR abs/2210.07911 (2022) - 2021
- Toshiya Itoh, Shuichi Miyazaki
, Makoto Satake:
Competitive analysis for two variants of online metric matching problem. Discret. Math. Algorithms Appl. 13(6): 2150156:1-2150156:16 (2021) - Suthee Ruangwises
, Toshiya Itoh:
Unpopularity Factor in the Marriage and Roommates Problems. Theory Comput. Syst. 65(3): 579-592 (2021) - Suthee Ruangwises
, Toshiya Itoh
:
Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem. New Gener. Comput. 39(1): 3-17 (2021) - Suthee Ruangwises
, Toshiya Itoh
:
Securely computing the n-variable equality function with 2n cards. Theor. Comput. Sci. 887: 99-110 (2021) - Suthee Ruangwises
, Toshiya Itoh:
Physical zero-knowledge proof for Ripple Effect. Theor. Comput. Sci. 895: 115-123 (2021) - Suthee Ruangwises
, Toshiya Itoh
:
Physical Zero-Knowledge Proof for Numberlink. FUN 2021: 22:1-22:11 - Suthee Ruangwises
, Toshiya Itoh
:
Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems. UCNC 2021: 149-163 - Suthee Ruangwises
, Toshiya Itoh
:
Physical Zero-Knowledge Proof for Ripple Effect. WALCOM 2021: 296-307 - Steven Ge, Toshiya Itoh:
Characterization of the Imbalance Problem on Complete Bipartite Graphs. CoRR abs/2111.00154 (2021) - Suthee Ruangwises, Toshiya Itoh:
Physical ZKP for Makaro Using a Standard Deck of Cards. CoRR abs/2112.12042 (2021) - 2020
- Toshiya Itoh
, Shuichi Miyazaki
, Makoto Satake:
Competitive Analysis for Two Variants of Online Metric Matching Problem. COCOA 2020: 486-498 - Suthee Ruangwises
, Toshiya Itoh
:
Securely Computing the n-Variable Equality Function with 2n Cards. TAMC 2020: 25-36 - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Numberlink. CoRR abs/2002.01143 (2020) - Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
Competitive Analysis for Two Variants of Online Metric Matching Problem. CoRR abs/2008.08415 (2020) - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Ripple Effect. CoRR abs/2009.09983 (2020) - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle. CoRR abs/2011.02313 (2020) - 2019
- Toshiya Itoh, Yoshinori Takei:
On the Competitive Analysis for the Multi-Objective Time Series Search Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1150-1158 (2019) - Suthee Ruangwises
, Toshiya Itoh:
Random Popular Matchings with Incomplete Preference Lists. J. Graph Algorithms Appl. 23(5): 815-835 (2019) - Suthee Ruangwises
, Toshiya Itoh:
Unpopularity Factor in the Marriage and Roommates Problems. CSR 2019: 337-348
skipping 61 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-27 06:22 CEST 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