Brendan Mumey - RankMe

84 papers A* 4A 2B 12C 4Misc 4Journal 35Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximately Partitioning Vertices into Short Paths. CoRR Mingyang Gong, Zhi-Zhong Chen, Brendan Mumey
2026	J	`jnl`	Offline green bin packing and its constrained variant. CoRR Mingyang Gong, Brendan Mumey
2025	J	`jnl`	An EPTAS for multiprocessor scheduling with rejection under a machine cost constraint. CoRR Mingyang Gong, Brendan Mumey
2025	J	`jnl`	An improved local search based algorithm for k CoRR Mingyang Gong, Guohui Lin, Brendan Mumey
2025	J	`jnl`	Fast Approximate Rank Determination and Selection with Group Testing. CoRR Adiesha Liyanage, Braeden Sopp, Brendan Mumey
2025	C	`conf`	Genotype-to-Phenotype Associations in Yeast with Frequented Region Variants and Deep Learning. ICMLA Tejaswi Vemuri, Trung Dinh, Zonglin Yang, Thiruvarangan Ramaraj, Joann Mudge, Brendan Mumey, Indika Kahanda
2025	J	`jnl`	Minimum flow decomposition in graphs with cycles using integer linear programming. J. Glob. Optim. Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2024	J	`jnl`	Parameterised Approximation and Complexity of Minimum Flow Decompositions. CoRR Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey, Alexandru I. Tomescu
2024	B	`conf`	Practical Minimum Path Cover. SEA Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2024	J	`jnl`	Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2023	J	`jnl`	A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	J	`jnl`	A safety framework for flow decomposition problems via integer linear programming. Bioinform. Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	—	`conf`	Development of an ontology for biofilms. BIBM Thiruvarangan Ramaraj, Bo Wen Liu, Britney Gibbs, Azalea Mendoza, David L. Millman, Brendan Mumey, Matthew Fields, Callum Bell
2023	J	`jnl`	Flow Decomposition With Subpath Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. Lucia Williams, Alexandru I. Tomescu, Brendan Mumey
2023	—	`conf`	Genotype-to-Phenotype Associations with Frequented Region Variants. BIBM Indika Kahanda, Buwani Manuweera, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary, Joann Mudge
2023	J	`jnl`	Minimum Path Cover: The Power of Parameterization. CoRR Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2022	J	`jnl`	Efficient Minimum Flow Decomposition via Integer Linear Programming. J. Comput. Biol. Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	J	`jnl`	Fast Circular Pattern Matching. CoRR Will Solow, Matthew Barich, Brendan Mumey
2022	B	`conf`	Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. RECOMB Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	J	`jnl`	Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming. CoRR Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	J	`jnl`	Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	J	`jnl`	Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
2022	A*	`conf`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	A	`conf`	Width Helps and Hinders Splitting Flows. ESA Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2022	J	`jnl`	Width Helps and Hinders Splitting Flows. CoRR Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2021	B	`conf`	A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	C	`conf`	Flow Decomposition with Subpath Constraints. WABI Lucia Williams, Alexandru I. Tomescu, Brendan Mumey
2021	J	`jnl`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2020	—	`conf`	Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics. AlCoB Lucia Williams, Brendan Mumey
2020	J	`jnl`	On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2020	C	`conf`	Scheduling Jobs with Precedence Constraints to Minimize Peak Demand. COCOA Elliott Pryor, Brendan Mumey, Sean Yaw
2019	J	`jnl`	Exploring Frequented Regions in Pan-Genomic Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. Alan M. Cleary, Thiruvarangan Ramaraj, Indika Kahanda, Joann Mudge, Brendan Mumey
2019	—	`conf`	Pangenome-Wide Association Studies with Frequented Regions. BCB Buwani Manuweera, Joann Mudge, Indika Kahanda, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary
2019	—	`conf`	Poster: Pangenome-Wide Association Studies with Frequented Regions. BCB Buwani Manuweera, Joann Mudge, Indika Kahanda, Brendan Mumey, Thiruvarangan Ramaraj, Alan M. Cleary
2019	—	`conf`	RNA Transcript Assembly Using Inexact Flows. BIBM Lucia Williams, Gillian Reynolds, Brendan Mumey
2018	J	`jnl`	Indexing Point Sets for Approximate Bottleneck Distance Queries. CoRR Brendan Mumey
2017	B	`conf`	Efficient multipath flow monitoring. Networking Samuel Micka, Sean Yaw, Brittany Terese Fasy, Brendan Mumey, Mike P. Wittie
2017	—	`conf`	Exploring Frequented Regions in Pan-Genomic Graphs. BCB Alan M. Cleary, Indika Kahanda, Brendan Mumey, Joann Mudge, Thiruvarangan Ramaraj
2017	J	`jnl`	Scheduling Non-Preemptible Jobs to Minimize Peak Demand. Algorithms Sean Yaw, Brendan Mumey
2015	J	`jnl`	Cooperative group provisioning with latency guarantees in multi-cloud deployments. Comput. Commun. Rev. Sean Yaw, Eben Howard, Brendan Mumey, Mike P. Wittie
2015	—	`conf`	Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers. ICC Jielong Xu, Jian Tang, Brendan Mumey, Weiyi Zhang, Kevin A. Kwiat, Charles A. Kamhoua
2015	—	`conf`	Finding Pathways to Student Success from Data. CSEDU (1) Brendan Mumey, Sean Yaw, Christina Fastnow, David J. Singel
2015	—	`conf`	Parity Balancing Path Flow Decomposition and Routing. GLOBECOM Workshops Brendan Mumey, Samareh Shahmohammadi, Kathryn McManus, Sean Yaw
2015	B	`conf`	pcp: Internet Latency Estimation Using CDN Replicas. ICCCN Samuel Micka, Utkarsh Goel, Hanlu Ye, Mike P. Wittie, Brendan Mumey
2014	C	`conf`	An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling. COCOA Sean Yaw, Brendan Mumey
2014	Misc	`conf`	Minimizing channel rental costs for topology control in multihop wireless networks. ICNC Ivan R. Judson, Brendan Mumey
2014	—	`conf`	Peak demand scheduling in the Smart Grid. SmartGridComm Sean Yaw, Brendan Mumey, Erin McDonald, Jennifer Lemke
2014	Misc	`conf`	Ubiquitous sensor data collection with mobile users. ICNC Brendan Mumey, Gang Xu, Edith C. H. Ngai
2013	A*	`conf`	Beam scheduling and relay assignment in wireless relay networks with smart antennas. INFOCOM Brendan Mumey, Jian Tang, Ivan R. Judson, Richard S. Wolff
2013	—	`conf`	Extending the lifetime of a WSN by partial covers. ICC Brendan Mumey, Kelly Spendlove, Binhai Zhu
2013	B	`conf`	Scheduling uncertain links in multihop cognitive relay networks. GLOBECOM Brendan Mumey, Riku Jäntti, Sean Yaw
2012	B	`conf`	Distributed multiple relay selection by an auction mechanism. GLOBECOM Chia-Hao Yu, Brendan Mumey, Olav Tirkkonen
2012	—	`conf`	Enabling green networking with a power down approach. ICC Brendan Mumey, Jian Tang, Saiichi Hashimoto
2012	J	`jnl`	Leveraging Cooperative, Channel and Multiuser Diversities for Efficient Resource Allocation in Wireless Relay Networks. IEEE J. Sel. Areas Commun. Jian Tang, Brendan Mumey, Kairat Zhubayev, Richard S. Wolff
2012	J	`jnl`	On Routing and Channel Selection in Cognitive Radio Mesh Networks. IEEE Trans. Veh. Technol. Brendan Mumey, Jian Tang, Ivan R. Judson, David Stevens
2012	A*	`conf`	On exploiting flow allocation with rate adaptation for green networking. INFOCOM Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
2012	—	`conf`	Simple and effective routing and wavelength assignment in transparent optical networks. ICC Brendan Mumey, Timothy Hahn, Richard S. Wolff
2012	Misc	`conf`	Topology control in multihop wireless networks with multi-beam smart antennas. ICNC Brendan Mumey, Ivan R. Judson, Jian Tang, Yun Xing
2011	J	`jnl`	A distributed impairment aware QoS framework for all-optical networks. Opt. Switch. Netw. Wenhao Lin, Timothy Hahn, Richard S. Wolff, Brendan Mumey
2011	B	`conf`	Leveraging Multi-User Diversity, Channel Diversity and Spatial Reuse for Efficient Scheduling in Wireless Relay Networks. MASS Shen Wan, Jian Tang, Brendan Mumey, Richard S. Wolff, Weiyi Zhang
2011	—	`conf`	On Multipath Transmission Scheduling in Cognitive Radio Mesh Networks. GreeNets Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wolff
2011	B	`conf`	Relay Beam Selection with Directional Antennas. GLOBECOM Brendan Mumey, Jian Tang, Yun Xing, Richard S. Wolff
2010	—	`conf`	Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links. ICC Brendan Mumey, Jian Tang, Timothy Hahn
2010	B	`conf`	On Exploiting Cooperative, Channel and Multiuser Diversities in Wireless Relay Networks. GLOBECOM Jian Tang, Brendan Mumey, Kairat Zhubayev, Richard S. Wolff
2010	B	`conf`	Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks. SECON Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wolff
2008	J	`jnl`	Decreasing EDFA transients by power shaping. Opt. Switch. Netw. Wenhao Lin, Richard S. Wolff, Brendan Mumey
2008	—	`conf`	Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links. ICC Brendan Mumey, Jian Tang, Timothy Hahn
2007	J	`jnl`	Approximating the fixed linear crossing number. Discret. Appl. Math. Robert J. Cimikowski, Brendan Mumey
2007	J	`jnl`	Discovering classes in microarray data using island counts. J. Comb. Optim. Brendan Mumey, Louise C. Showe, Michael K. Showe
2006	—	`conf`	Filtering Epitope Alignments to Improve Protein Surface Prediction. ISPA Workshops Brendan Mumey, Nathaniel Ohler, Thomas Angel, Algirdas J. Jesaitis, Edward A. Dratz
2004	—	`conf`	Approximations for Two Decomposition-Based Geometric Optimization Problems. ICCSA (3) Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, Binhai Zhu
2004	J	`jnl`	Finding neural codes using random projections. Neurocomputing Brendan Mumey, Aditi Sarkar, Tomás Gedeon, Alexander Dimitrov, John P. Miller
2003	J	`jnl`	A New Method for Mapping Discontinuous Antibody Epitopes to Reveal Structural Features of Proteins. J. Comput. Biol. Brendan Mumey, Brian W. Bailey, Bonnie Kirkpatrick, Algirdas J. Jesaitis, Thomas Angel, Edward A. Dratz
2003	Misc	`conf`	Derivation of Natural Stimulus Feature Set Using a Data-Driven Model. International Conference on Computational Science Alexander Dimitrov, Tomás Gedeon, Brendan Mumey, Ross Snider, Albert E. Parker, John P. Miller
2003	—	`conf`	Mapping Discontinuous Antibody Epitopes to Reveal Protein Structure and Changes in Structure Related to Function. CSB Brendan Mumey, Thomas Angel, Bonnie Kirkpatrick, Brian W. Bailey, P. Hargrave, Algirdas J. Jesaitis, Edward A. Dratz
2002	B	`conf`	Revealing protein structures: a new method for mapping antibody epitopes. RECOMB Brendan Mumey, Brian W. Bailey, Edward A. Dratz
2000	J	`jnl`	Probe location in the presence of errors: a problem from DNA mapping. Discret. Appl. Math. Brendan Mumey
2000	J	`jnl`	Teaching advanced problem solving: implications for the CS curriculum. J. Comput. Sci. Coll. John T. Paxton, Brendan Mumey
1997	A	`conf`	A Fast Heuristic Algorithm for a Probe Mapping Problem. ISMB Brendan Mumey
1997	—	`conf`	A Model and Method for Detecting Errors in Data Sets. German Conference on Bioinformatics Brendan Mumey
1997	—	`—`	Some computational problems from genomic mapping. Brendan Mumey
1995	J	`jnl`	Upper and Lower Bounds on Constructing Alphabetic Binary Trees. SIAM J. Discret. Math. Maria M. Klawe, Brendan Mumey
1994	—	`conf`	Finding friends-of-friends clusters quickly. Parallel Algorithms Brendan Mumey
1993	A*	`conf`	Upper and Lower Bounds on Constructing Alphabetic Binary Trees. SODA Maria M. Klawe, Brendan Mumey