default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrendan Mumey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Manuel Cáceres
, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024)- [c47]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Practical Minimum Path Cover. SEA 2024: 3:1-3:19 - [i10]Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey, Alexandru I. Tomescu:
Parameterised Approximation and Complexity of Minimum Flow Decompositions. CoRR abs/2409.20278 (2024) - 2023
- [j17]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A safety framework for flow decomposition problems via integer linear programming. Bioinform. 39(10) (2023) - [j16]Lucia Williams, Alexandru I. Tomescu, Brendan Mumey:
Flow Decomposition With Subpath Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 360-370 (2023) - [c46]Indika Kahanda, Buwani Manuweera, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary, Joann Mudge:
Genotype-to-Phenotype Associations with Frequented Region Variants. BIBM 2023: 114-119 - [c45]Thiruvarangan Ramaraj, Bo Wen Liu, Britney Gibbs, Azalea Mendoza, David L. Millman, Brendan Mumey, Matthew Fields, Callum Bell:
Development of an ontology for biofilms. BIBM 2023: 2932-2937 - [i9]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR abs/2301.13245 (2023) - [i8]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Minimum Path Cover: The Power of Parameterization. CoRR abs/2308.08960 (2023) - 2022
- [j15]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Efficient Minimum Flow Decomposition via Integer Linear Programming. J. Comput. Biol. 29(11): 1252-1267 (2022) - [j14]Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - [c44]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - [c43]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. RECOMB 2022: 230-245 - [c42]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA 2022: 359-376 - [i7]Will Solow, Matthew Barich, Brendan Mumey:
Fast Circular Pattern Matching. CoRR abs/2204.09562 (2022) - [i6]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - [i5]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming. CoRR abs/2209.00042 (2022) - [i4]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - 2021
- [c41]Lucia Williams, Alexandru I. Tomescu, Brendan Mumey:
Flow Decomposition with Subpath Constraints. WABI 2021: 16:1-16:15 - [c40]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG 2021: 257-269 - [i3]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR abs/2107.05717 (2021) - 2020
- [c39]Lucia Williams, Brendan Mumey:
Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics. AlCoB 2020: 41-48 - [c38]Elliott Pryor, Brendan Mumey, Sean Yaw:
Scheduling Jobs with Precedence Constraints to Minimize Peak Demand. COCOA 2020: 140-150 - [i2]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR abs/2007.07575 (2020)
2010 – 2019
- 2019
- [j13]Alan M. Cleary, Thiruvarangan Ramaraj, Indika Kahanda, Joann Mudge, Brendan Mumey:
Exploring Frequented Regions in Pan-Genomic Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5): 1424-1435 (2019) - [c37]Buwani Manuweera, Joann Mudge, Indika Kahanda, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary:
Poster: Pangenome-Wide Association Studies with Frequented Regions. BCB 2019: 537 - [c36]Buwani Manuweera, Joann Mudge, Indika Kahanda, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary:
Pangenome-Wide Association Studies with Frequented Regions. BCB 2019: 627-632 - [c35]Lucia Williams, Gillian Reynolds, Brendan Mumey:
RNA Transcript Assembly Using Inexact Flows. BIBM 2019: 1907-1914 - 2018
- [i1]Brendan Mumey:
Indexing Point Sets for Approximate Bottleneck Distance Queries. CoRR abs/1810.09482 (2018) - 2017
- [j12]Sean Yaw, Brendan Mumey:
Scheduling Non-Preemptible Jobs to Minimize Peak Demand. Algorithms 10(4): 122 (2017) - [c34]Alan M. Cleary, Indika Kahanda, Brendan Mumey, Joann Mudge, Thiruvarangan Ramaraj:
Exploring Frequented Regions in Pan-Genomic Graphs. BCB 2017: 89-97 - [c33]Samuel Micka, Sean Yaw, Brittany Terese Fasy, Brendan Mumey, Mike P. Wittie:
Efficient multipath flow monitoring. Networking 2017: 1-9 - 2015
- [j11]Sean Yaw, Eben Howard, Brendan Mumey, Mike P. Wittie:
Cooperative group provisioning with latency guarantees in multi-cloud deployments. Comput. Commun. Rev. 45(3): 4-11 (2015) - [c32]Brendan Mumey, Sean Yaw, Christina Fastnow, David J. Singel:
Finding Pathways to Student Success from Data. CSEDU (1) 2015: 457-460 - [c31]Brendan Mumey, Samareh Shahmohammadi, Kathryn McManus, Sean Yaw:
Parity Balancing Path Flow Decomposition and Routing. GLOBECOM Workshops 2015: 1-6 - [c30]Jielong Xu, Jian Tang, Brendan Mumey, Weiyi Zhang, Kevin A. Kwiat, Charles A. Kamhoua:
Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers. ICC 2015: 5466-5472 - [c29]Samuel Micka, Utkarsh Goel, Hanlu Ye, Mike P. Wittie, Brendan Mumey:
pcp: Internet Latency Estimation Using CDN Replicas. ICCCN 2015: 1-8 - 2014
- [c28]Sean Yaw, Brendan Mumey:
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling. COCOA 2014: 3-12 - [c27]Brendan Mumey, Gang Xu, Edith C. H. Ngai:
Ubiquitous sensor data collection with mobile users. ICNC 2014: 561-566 - [c26]Ivan R. Judson, Brendan Mumey:
Minimizing channel rental costs for topology control in multihop wireless networks. ICNC 2014: 819-824 - [c25]Sean Yaw, Brendan Mumey, Erin McDonald, Jennifer Lemke:
Peak demand scheduling in the Smart Grid. SmartGridComm 2014: 770-775 - 2013
- [c24]Brendan Mumey, Riku Jäntti, Sean Yaw:
Scheduling uncertain links in multihop cognitive relay networks. GLOBECOM 2013: 1203-1208 - [c23]Brendan Mumey, Kelly Spendlove, Binhai Zhu:
Extending the lifetime of a WSN by partial covers. ICC 2013: 1779-1783 - [c22]Brendan Mumey, Jian Tang, Ivan R. Judson, Richard S. Wolff:
Beam scheduling and relay assignment in wireless relay networks with smart antennas. INFOCOM 2013: 130-134 - 2012
- [j10]Jian Tang, Brendan Mumey, Kairat Zhubayev, Richard S. Wolff:
Leveraging Cooperative, Channel and Multiuser Diversities for Efficient Resource Allocation in Wireless Relay Networks. IEEE J. Sel. Areas Commun. 30(9): 1789-1797 (2012) - [j9]Brendan Mumey, Jian Tang, Ivan R. Judson, David Stevens:
On Routing and Channel Selection in Cognitive Radio Mesh Networks. IEEE Trans. Veh. Technol. 61(9): 4118-4128 (2012) - [c21]Chia-Hao Yu, Brendan Mumey, Olav Tirkkonen:
Distributed multiple relay selection by an auction mechanism. GLOBECOM 2012: 4392-4397 - [c20]Brendan Mumey, Jian Tang, Saiichi Hashimoto:
Enabling green networking with a power down approach. ICC 2012: 2867-2871 - [c19]Brendan Mumey, Timothy Hahn, Richard S. Wolff:
Simple and effective routing and wavelength assignment in transparent optical networks. ICC 2012: 3089-3093 - [c18]Brendan Mumey, Ivan R. Judson, Jian Tang, Yun Xing:
Topology control in multihop wireless networks with multi-beam smart antennas. ICNC 2012: 1020-1024 - [c17]Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson:
On exploiting flow allocation with rate adaptation for green networking. INFOCOM 2012: 1683-1691 - 2011
- [j8]Wenhao Lin, Timothy Hahn, Richard S. Wolff, Brendan Mumey:
A distributed impairment aware QoS framework for all-optical networks. Opt. Switch. Netw. 8(1): 56-67 (2011) - [c16]Brendan Mumey, Jian Tang, Yun Xing, Richard S. Wolff:
Relay Beam Selection with Directional Antennas. GLOBECOM 2011: 1-5 - [c15]Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wolff:
On Multipath Transmission Scheduling in Cognitive Radio Mesh Networks. GreeNets 2011: 135-147 - [c14]Shen Wan, Jian Tang, Brendan Mumey, Richard S. Wolff, Weiyi Zhang:
Leveraging Multi-User Diversity, Channel Diversity and Spatial Reuse for Efficient Scheduling in Wireless Relay Networks. MASS 2011: 401-410 - 2010
- [c13]Jian Tang, Brendan Mumey, Kairat Zhubayev, Richard S. Wolff:
On Exploiting Cooperative, Channel and Multiuser Diversities in Wireless Relay Networks. GLOBECOM 2010: 1-6 - [c12]Brendan Mumey, Jian Tang, Timothy Hahn:
Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links. ICC 2010: 1-6 - [c11]Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wolff:
Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks. SECON 2010: 297-304
2000 – 2009
- 2008
- [j7]Wenhao Lin, Richard S. Wolff, Brendan Mumey:
Decreasing EDFA transients by power shaping. Opt. Switch. Netw. 5(4): 188-195 (2008) - [c10]Brendan Mumey, Jian Tang, Timothy Hahn:
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links. ICC 2008: 2921-2925 - 2007
- [j6]Robert J. Cimikowski, Brendan Mumey:
Approximating the fixed linear crossing number. Discret. Appl. Math. 155(17): 2202-2210 (2007) - [j5]Brendan Mumey, Louise C. Showe, Michael K. Showe:
Discovering classes in microarray data using island counts. J. Comb. Optim. 13(3): 207-216 (2007) - 2006
- [c9]Brendan Mumey, Nathaniel Ohler, Thomas Angel, Algirdas J. Jesaitis, Edward A. Dratz:
Filtering Epitope Alignments to Improve Protein Surface Prediction. ISPA Workshops 2006: 648-657 - 2004
- [j4]Brendan Mumey, Aditi Sarkar, Tomás Gedeon, Alexander Dimitrov, John P. Miller:
Finding neural codes using random projections. Neurocomputing 58-60: 19-25 (2004) - [c8]Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, Binhai Zhu:
Approximations for Two Decomposition-Based Geometric Optimization Problems. ICCSA (3) 2004: 90-98 - 2003
- [j3]Brendan Mumey, Brian W. Bailey, Bonnie Kirkpatrick, Algirdas J. Jesaitis, Thomas Angel, Edward A. Dratz:
A New Method for Mapping Discontinuous Antibody Epitopes to Reveal Structural Features of Proteins. J. Comput. Biol. 10(3/4): 555-567 (2003) - [c7]Brendan Mumey, Thomas Angel, Bonnie Kirkpatrick, Brian W. Bailey, P. Hargrave, Algirdas J. Jesaitis, Edward A. Dratz:
Mapping Discontinuous Antibody Epitopes to Reveal Protein Structure and Changes in Structure Related to Function. CSB 2003: 585-586 - [c6]Alexander Dimitrov, Tomás Gedeon, Brendan Mumey, Ross Snider, Albert E. Parker, John P. Miller:
Derivation of Natural Stimulus Feature Set Using a Data-Driven Model. International Conference on Computational Science 2003: 337-345 - 2002
- [c5]Brendan Mumey, Brian W. Bailey, Edward A. Dratz:
Revealing protein structures: a new method for mapping antibody epitopes. RECOMB 2002: 233-240 - 2000
- [j2]Brendan Mumey:
Probe location in the presence of errors: a problem from DNA mapping. Discret. Appl. Math. 104(1-3): 187-201 (2000)
1990 – 1999
- 1997
- [b1]Brendan Mumey:
Some computational problems from genomic mapping. University of Washington, USA, 1997 - [c4]Brendan Mumey:
A Model and Method for Detecting Errors in Data Sets. German Conference on Bioinformatics 1997: 73-77 - [c3]Brendan Mumey:
A Fast Heuristic Algorithm for a Probe Mapping Problem. ISMB 1997: 191-197 - 1995
- [j1]Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. SIAM J. Discret. Math. 8(4): 638-651 (1995) - 1994
- [c2]Brendan Mumey:
Finding friends-of-friends clusters quickly. Parallel Algorithms 1994: 69-79 - 1993
- [c1]Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. SODA 1993: 185-193
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-10-22 20:14 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:
