default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert W. Irving
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c19]Tomohiro I
, Robert W. Irving, Dominik Köppl, Lorna Love:
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE 2021: 143-150
2010 – 2019
- 2019
- [j43]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Short Lists. Theory Comput. Syst. 63(1): 128-149 (2019) - 2016
- [j42]Péter Biró, Tamás Fleiner, Robert W. Irving:
Matching couples with Scarf's algorithm. Ann. Math. Artif. Intell. 77(3-4): 303-316 (2016) - [c18]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Short Lists. SAGT 2016: 207-219 - [r4]Robert W. Irving:
Optimal Stable Marriage. Encyclopedia of Algorithms 2016: 1470-1473 - [r3]Robert W. Irving:
Stable Marriage. Encyclopedia of Algorithms 2016: 2060-2064 - [i2]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates problem with short lists. CoRR abs/1605.04609 (2016) - 2014
- [j41]Eric McDermid, Robert W. Irving:
Sex-Equal Stable Matchings: Complexity and Exact Algorithms. Algorithmica 68(3): 545-570 (2014) - [c17]Augustine Kwanashie, Robert W. Irving, David F. Manlove, Colin T. S. Sng:
Profile-Based Optimal Matchings in the Student/Project Allocation Problem. IWOCA 2014: 213-225 - [c16]Baharak Rastegari, Anne Condon, Nicole Immorlica, Robert W. Irving, Kevin Leyton-Brown:
Reasoning about optimal stable matchings under partial information. EC 2014: 431-448 - [i1]Augustine Kwanashie, Robert W. Irving, David F. Manlove, Colin T. S. Sng:
Profile-based optimal matchings in the Student/Project Allocation problem. CoRR abs/1403.0751 (2014) - 2013
- [j40]Takao Inoshita, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Takashi Nagase:
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms 6(2): 371-382 (2013) - 2011
- [j39]Eric McDermid, Robert W. Irving:
Popular matchings: structure and algorithms. J. Comb. Optim. 22(3): 339-358 (2011) - [j38]Péter Biró, Robert W. Irving, Ildikó Schlotter:
Stable matching with couples: An empirical study. ACM J. Exp. Algorithmics 16 (2011) - [j37]Tamás Fleiner, Robert W. Irving, David F. Manlove:
An algorithm for a super-stable roommates problem. Theor. Comput. Sci. 412(50): 7059-7065 (2011) - 2010
- [j36]David F. Manlove, Robert W. Irving, Kazuo Iwama:
Guest Editorial: Special Issue on Matching Under Preferences. Algorithmica 58(1): 1-4 (2010) - [j35]Susan Fairley, John McClure, Neil Hanlon, Robert W. Irving, Martin W. McBride, Anna F. Dominiczak, Ela Hunt:
Mapping Affymetrix Microarray Probes to the Rat Genome via a Persistent Index. Int. J. Knowl. Discov. Bioinform. 1(1): 48-65 (2010) - [j34]Péter Biró, Tamás Fleiner, Robert W. Irving, David F. Manlove:
The College Admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34-36): 3136-3153 (2010) - [c15]Péter Biró, Robert W. Irving, David F. Manlove:
Popular Matchings in the Marriage and Roommates Problems. CIAC 2010: 97-108
2000 – 2009
- 2009
- [j33]Robert W. Irving, David F. Manlove, Gregg O'Malley:
Stable marriage with ties and bounded length preference lists. J. Discrete Algorithms 7(2): 213-219 (2009) - [j32]Robert W. Irving, David F. Manlove:
Finding large stable matchings. ACM J. Exp. Algorithmics 14 (2009) - [c14]Eric McDermid, Robert W. Irving:
Popular Matchings: Structure and Algorithms. COCOON 2009: 506-515 - 2008
- [j31]Robert W. Irving, David F. Manlove, Sandy Scott:
The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15): 2959-2977 (2008) - [j30]Robert W. Irving, David F. Manlove:
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. J. Comb. Optim. 16(3): 279-292 (2008) - [j29]Robert W. Irving:
Stable matching problems with exchange restrictions. J. Comb. Optim. 16(4): 344-360 (2008) - [r2]Robert W. Irving:
Optimal Stable Marriage. Encyclopedia of Algorithms 2008 - [r1]Robert W. Irving:
Stable Marriage. Encyclopedia of Algorithms 2008 - 2007
- [j28]Robert W. Irving, Sandy Scott:
The stable fixtures problem - A many-to-many extension of stable roommates. Discret. Appl. Math. 155(16): 2118-2129 (2007) - [j27]Robert W. Irving:
The cycle roommates problem: a hard case of kidney exchange. Inf. Process. Lett. 103(1): 1-4 (2007) - [j26]David J. Abraham, Robert W. Irving, David F. Manlove:
Two algorithms for the Student-Project Allocation problem. J. Discrete Algorithms 5(1): 73-90 (2007) - [j25]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007) - [j24]Tamás Fleiner, Robert W. Irving, David F. Manlove:
Efficient algorithms for generalized Stable Marriage and Roommates problems. Theor. Comput. Sci. 381(1-3): 162-176 (2007) - [c13]Robert W. Irving, David F. Manlove:
An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage. COCOON 2007: 548-558 - 2006
- [j23]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. ACM Trans. Algorithms 2(4): 602-610 (2006) - [c12]Robert W. Irving, David F. Manlove, Gregg O'Malley:
Stable Marriage with Ties and Bounded Length Preference Lists. ACiD 2006: 95-106 - 2005
- [c11]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular matchings. SODA 2005: 424-432 - 2004
- [c10]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. SODA 2004: 68-75 - 2003
- [j22]Robert W. Irving, Lorna Love:
The suffix binary search tree and suffix AVL tree. J. Discrete Algorithms 1(5-6): 387-408 (2003) - [j21]Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott:
Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3): 431-447 (2003) - [c9]David J. Abraham, Robert W. Irving, David F. Manlove:
The Student-Project Allocation Problem. ISAAC 2003: 474-484 - [c8]Robert W. Irving, David F. Manlove, Sandy Scott:
Strong Stability in the Hospitals/Residents Problem. STACS 2003: 439-450 - 2002
- [j20]Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Ties. J. Algorithms 43(1): 85-105 (2002) - [j19]David F. Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2): 261-279 (2002) - [j18]Ela Hunt, Malcolm P. Atkinson, Robert W. Irving:
Database indexing for large DNA and protein sequence collections. VLDB J. 11(3): 256-271 (2002) - 2001
- [j17]David A. Christie, Robert W. Irving:
Sorting Strings by Reversals and by Transpositions. SIAM J. Discret. Math. 14(2): 193-206 (2001) - [c7]Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith:
A Constraint Programming Approach to the Stable Marriage Problem. CP 2001: 225-239 - [c6]Ela Hunt, Malcolm P. Atkinson, Robert W. Irving:
A Database Index to Large Biological Sequences. VLDB 2001: 139-148 - 2000
- [c5]Robert W. Irving, David F. Manlove, Sandy Scott:
The Hospitals/Residents Problem with Ties. SWAT 2000: 259-271
1990 – 1999
- 1999
- [j16]Robert W. Irving, David F. Manlove:
The b-chromatic Number of a Graph. Discret. Appl. Math. 91(1-3): 127-141 (1999) - 1998
- [c4]Robert W. Irving:
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme. ESA 1998: 381-392 - 1996
- [j15]Campbell Fraser, Robert W. Irving, Martin Middendorf:
Maximal Common Subsequences and Minimal Common Supersequences. Inf. Comput. 124(2): 145-153 (1996) - 1995
- [j14]C. B. Fraser, Robert W. Irving:
Approximation Algorithms for the Shortest Common Supersequence. Nord. J. Comput. 2(3): 303-325 (1995) - 1994
- [j13]Robert W. Irving:
Stable Marriage and Indifference. Discret. Appl. Math. 48(3): 261-272 (1994) - [j12]Boris G. Pittel, Robert W. Irving:
An Upper Bound for the Solvability of a Random Stable Roommates Instance. Random Struct. Algorithms 5(3): 465-487 (1994) - [j11]Robert W. Irving, Mark Jerrum:
Three-Dimensional Statistical Data Security Problems. SIAM J. Comput. 23(1): 170-184 (1994) - [c3]Robert W. Irving, Campbell Fraser:
Maximal Common Subsequences and Minimal Common Supersequences. CPM 1994: 173-183 - 1993
- [c2]Robert W. Irving, Campbell Fraser:
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings. CPM 1993: 63-73 - 1992
- [c1]Robert W. Irving, Campbell Fraser:
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings. CPM 1992: 214-229 - 1991
- [j10]Robert W. Irving:
On Approximating the Minimum Independent Dominating Set. Inf. Process. Lett. 37(4): 197-200 (1991)
1980 – 1989
- 1989
- [b1]Dan Gusfield, Robert W. Irving:
The Stable marriage problem - structure and algorithms. Foundations of computing series, MIT Press 1989, ISBN 978-0-262-07118-5, pp. I-XVII, 1-240 - [j9]Dan Gusfield, Robert W. Irving:
Parametric Stable Marriage and Minimum Cuts. Inf. Process. Lett. 30(5): 255-259 (1989) - 1987
- [j8]Robert W. Irving, Paul Leather, Dan Gusfield:
An efficient algorithm for the "optimal" stable marriage. J. ACM 34(3): 532-543 (1987) - [j7]Dan Gusfield, Robert W. Irving, Paul Leather, Michael E. Saks:
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. J. Comb. Theory A 44(2): 304-309 (1987) - 1986
- [j6]Robert W. Irving, Paul Leather:
The Complexity of Counting Stable Marriages. SIAM J. Comput. 15(3): 655-667 (1986) - 1985
- [j5]Robert W. Irving:
An Efficient Algorithm for the "Stable Roommates" Problem. J. Algorithms 6(4): 577-595 (1985) - 1984
- [j4]Robert W. Irving:
Permutation Backtracking in Lexicographic Order. Comput. J. 27(4): 373-375 (1984) - 1983
- [j3]Robert W. Irving:
NP-completeness of a family of graph-colouring problems. Discret. Appl. Math. 5(1): 111-117 (1983) - 1982
- [j2]Raymond Hill, Robert W. Irving:
On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers. Eur. J. Comb. 3(1): 35-50 (1982)
1970 – 1979
- 1974
- [j1]Robert W. Irving:
Generalised Ramsey numbers for small graphs. Discret. Math. 9(3): 251-264 (1974)
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-06-10 20:31 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:
