


default search action
Robert D. Barish
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Robert D. Barish, Tetsuo Shibuya:
Sokoban-style PushPush Games with Unique Solutions. J. Inf. Process. 33: 1101-1109 (2025)
[j5]Robert D. Barish
, Tetsuo Shibuya:
Affine optimal k-proper connected edge colorings. Optim. Lett. 19(1): 151-168 (2025)
[c14]Robert D. Barish
, Tetsuo Shibuya
:
Packing Dimers to Maximum Occupancy Under Soft-Core Constraints. CIAC (2) 2025: 283-298
[c13]Robert D. Barish
, Tetsuo Shibuya
:
Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles. FCT 2025: 45-56- 2024
[j4]Robert D. Barish
, Tetsuo Shibuya:
Proper colorability of segment intersection graphs. J. Comb. Optim. 47(4): 70 (2024)
[j3]Robert D. Barish
, Tetsuo Shibuya:
String editing under pattern constraints. Theor. Comput. Sci. 1022: 114889 (2024)
[c12]Robert D. Barish, Tetsuo Shibuya:
Polyhedral roll-connected colorings of partial tilings. CCCG 2024: 317-324
[c11]Robert D. Barish
, Tetsuo Shibuya
:
Fair Selection of Clearing Schemes for Kidney Exchange Markets. COCOA (2) 2024: 170-185
[c10]Robert D. Barish, Tetsuo Shibuya:
Recognition and Proper Coloring of Unit Segment Intersection Graphs. SWAT 2024: 5:1-5:19
[c9]Robert D. Barish
, Tetsuo Shibuya
:
Counting on Rainbow k-Connections. TAMC 2024: 272-283- 2023
[c8]Robert D. Barish
, Tetsuo Shibuya
:
The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract). COCOA (2) 2023: 123-136
[c7]Robert D. Barish
, Tetsuo Shibuya
:
Hardness of Bounding Influence via Graph Modification. SOFSEM 2023: 129-143- 2022
[c6]Robert D. Barish
, Tetsuo Shibuya
:
Proper Colorability of Segment Intersection Graphs. COCOON 2022: 573-584
[c5]Robert D. Barish, Tetsuo Shibuya:
Counting on a Rainbow Connection (text not included). ICTCS 2022
[c4]Robert D. Barish
, Tetsuo Shibuya
:
String Editing Under Pattern Constraints. ICS 2022: 13-24
[c3]Robert D. Barish
, Tetsuo Shibuya
:
Counting 2-Factors of 4-Regular Bipartite Graphs is #P-Complete. JCDCGGG 2022: 94-103- 2020
[j2]Robert D. Barish, Akira Suyama:
Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs. Graphs Comb. 36(2): 387-400 (2020)
[j1]Robert D. Barish, Akira Suyama:
Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs. J. Inf. Process. 28: 876-888 (2020)
2010 – 2019
- 2018
[c2]Robert D. Barish, Akira Suyama:
Barnette's Conjecture Through the Lens of the ModkP Complexity Classes. JCDCGGG 2018: 59-73- 2017
[c1]Robert D. Barish, Akira Suyama:
Counting Substrate Cycles in Topologically Restricted Metabolic Networks. CiE 2017: 129-140

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 2026-01-18 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







