


default search action
Michael P. O'Brien
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j3]Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk
, Blair D. Sullivan
:
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021)
2010 – 2019
- 2018
- [c11]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl
, Fernando Sánchez Villaamil, Blair D. Sullivan
, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. ALENEX 2018: 75-86 - [c10]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
:
Treedepth Bounds in Linear Colorings. WG 2018: 331-343 - [i7]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan:
Treedepth Bounds in Linear Colorings. CoRR abs/1802.09665 (2018) - 2017
- [c9]Irene Muzi, Michael P. O'Brien, Felix Reidl
, Blair D. Sullivan
:
Being Even Slightly Shallow Makes Life Hard. MFCS 2017: 79:1-79:13 - [i6]Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being even slightly shallow makes life hard. CoRR abs/1705.06796 (2017) - [i5]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. CoRR abs/1706.07851 (2017) - [i4]Michael P. O'Brien, Blair D. Sullivan:
Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion. CoRR abs/1712.06690 (2017) - 2016
- [c8]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl
, Blair D. Sullivan
, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. ICDM 2016: 829-834 - [i3]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. CoRR abs/1609.05081 (2016) - 2015
- [j2]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl
, Fernando Sánchez Villaamil, Blair D. Sullivan
:
Zig-Zag Numberlink is NP-Complete. J. Inf. Process. 23(3): 239-245 (2015) - 2014
- [c7]Michael P. O'Brien, Blair D. Sullivan
:
Locally Estimating Core Numbers. ICDM 2014: 460-469 - [c6]Steve Harenberg, Ramona G. Seay, Stephen Ranshous, Kanchana Padmanabhan, Jitendra K. Harlalka, Eric R. Schendel
, Michael P. O'Brien, Rada Chirkova, William Hendrix, Alok N. Choudhary, Vipin Kumar, Murali Doraiswamy, Nagiza F. Samatova:
Memory-efficient Query-driven Community Detection with Application to Complex Disease Associations. SDM 2014: 1010-1018 - [i2]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. CoRR abs/1410.5845 (2014) - [i1]Michael P. O'Brien, Blair D. Sullivan:
Locally Estimating Core Numbers. CoRR abs/1410.6793 (2014)
2000 – 2009
- 2006
- [c5]Jim Buckley, Michael P. O'Brien, Norah Power:
Empirically Refining a Model of Programmers' Information-Seeking Behavior during Software Maintenance. PPIG 2006: 21 - 2005
- [c4]Michael P. O'Brien
, Jim Buckley
, Christopher Exton:
Empirically Studying Software Practitioners - Bridging the Gap between Theory and Practice. ICSM 2005: 433-442 - [c3]Michael P. O'Brien, Jim Buckley:
Modelling the Information-Seeking Behaviour of Programmers - An Empirical Approach. IWPC 2005: 125-134 - 2004
- [j1]Michael P. O'Brien
, Jim Buckley
, Teresa M. Shaft
:
Expectation-based, inference-based, and bottom-up software comprehension. J. Softw. Maintenance Res. Pract. 16(6): 427-447 (2004) - 2001
- [c2]Michael P. O'Brien
, Jim Buckley
:
Inference-Based and Expectation-Based Processing in Program Comprehension. IWPC 2001: 71-78 - [c1]Michael P. O'Brien, Teresa M. Shaft, Jim Buckley:
An Open-Source Analysis Schema for Identifying Software Comprehension Processes. PPIG 2001: 11
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-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint