Brendan Mumey

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Minimum Path Cover: The Power of Parameterization.

[BibT_eX]

[DOI]

CoRR, 2023

Development of an ontology for biofilms.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

Genotype-to-Phenotype Associations with Frequented Region Variants.

[BibT_eX]

[DOI]

Indika Kahanda

Buwani Manuweera

Joann Mudge

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Efficient Minimum Flow Decomposition via Integer Linear Programming.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

CoRR, 2022

Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming.

[BibT_eX]

[DOI]

CoRR, 2022

Fast Circular Pattern Matching.

[BibT_eX]

[DOI]

Will Solow

Matthew Barich

CoRR, 2022

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Fast, Flexible, and Exact Minimum Flow Decompositions via ILP.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2022

Width Helps and Hinders Splitting Flows.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

On the parameterized complexity of the Minimum Path Cover problem in DAGs.

[BibT_eX]

[DOI]

CoRR, 2020

Scheduling Jobs with Precedence Constraints to Minimize Peak Demand.

[BibT_eX]

[DOI]

Elliott Pryor

Proceedings of the Combinatorial Optimization and Applications, 2020

Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics.

[BibT_eX]

[DOI]

Lucia Williams

Proceedings of the Algorithms for Computational Biology, 2020

2019

Exploring Frequented Regions in Pan-Genomic Graphs.

[BibT_eX]

[DOI]

Indika Kahanda

Joann Mudge

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

RNA Transcript Assembly Using Inexact Flows.

[BibT_eX]

[DOI]

Lucia Williams

Gillian Reynolds

Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

Pangenome-Wide Association Studies with Frequented Regions.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

Poster: Pangenome-Wide Association Studies with Frequented Regions.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018

Indexing Point Sets for Approximate Bottleneck Distance Queries.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Scheduling Non-Preemptible Jobs to Minimize Peak Demand.

[BibT_eX]

[DOI]

Algorithms, 2017

Efficient multipath flow monitoring.

[BibT_eX]

[DOI]

Proceedings of the 2017 IFIP Networking Conference, 2017

2015

Cooperative group provisioning with latency guarantees in multi-cloud deployments.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 2015

pcp: Internet Latency Estimation Using CDN Replicas.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Computer Communication and Networks, 2015

Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

Parity Balancing Path Flow Decomposition and Routing.

[BibT_eX]

[DOI]

Samareh Shahmohammadi

Kathryn McManus

Proceedings of the 2015 IEEE Globecom Workshops, San Diego, CA, USA, December 6-10, 2015, 2015

Finding Pathways to Student Success from Data.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2015, 2015

2014

Peak demand scheduling in the Smart Grid.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Smart Grid Communications, 2014

Ubiquitous sensor data collection with mobile users.

[BibT_eX]

[DOI]

Gang Xu

Edith C. H. Ngai

Proceedings of the International Conference on Computing, Networking and Communications, 2014

Minimizing channel rental costs for topology control in multihop wireless networks.

[BibT_eX]

[DOI]

Ivan R. Judson

Proceedings of the International Conference on Computing, Networking and Communications, 2014

An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Beam scheduling and relay assignment in wireless relay networks with smart antennas.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Extending the lifetime of a WSN by partial covers.

[BibT_eX]

[DOI]

Kelly Spendlove

Binhai Zhu

Proceedings of IEEE International Conference on Communications, 2013

Scheduling uncertain links in multihop cognitive relay networks.

[BibT_eX]

[DOI]

Riku Jäntti

Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012

On Routing and Channel Selection in Cognitive Radio Mesh Networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2012

Leveraging Cooperative, Channel and Multiuser Diversities for Efficient Resource Allocation in Wireless Relay Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2012

On exploiting flow allocation with rate adaptation for green networking.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Topology control in multihop wireless networks with multi-beam smart antennas.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2012

Enabling green networking with a power down approach.

[BibT_eX]

[DOI]

Jian Tang

Saiichi Hashimoto

Proceedings of IEEE International Conference on Communications, 2012

Simple and effective routing and wavelength assignment in transparent optical networks.

[BibT_eX]

[DOI]

Timothy Hahn

Richard S. Wolff

Proceedings of IEEE International Conference on Communications, 2012

Distributed multiple relay selection by an auction mechanism.

[BibT_eX]

[DOI]

Chia-Hao Yu

Olav Tirkkonen

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

A distributed impairment aware QoS framework for all-optical networks.

[BibT_eX]

[DOI]

Opt. Switch. Netw., 2011

Leveraging Multi-User Diversity, Channel Diversity and Spatial Reuse for Efficient Scheduling in Wireless Relay Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

On Multipath Transmission Scheduling in Cognitive Radio Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the Green Communications and Networking - First International Conference, 2011

Relay Beam Selection with Directional Antennas.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

2010

Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual IEEE Communications Society Conference on Sensor, 2010

Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links.

[BibT_eX]

[DOI]

Jian Tang

Timothy Hahn

Proceedings of IEEE International Conference on Communications, 2010

On Exploiting Cooperative, Channel and Multiuser Diversities in Wireless Relay Networks.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2010

2008

Decreasing EDFA transients by power shaping.

[BibT_eX]

[DOI]

Wenhao Lin

Richard S. Wolff

Opt. Switch. Netw., 2008

Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links.

[BibT_eX]

[DOI]

Jian Tang

Timothy Hahn

Proceedings of IEEE International Conference on Communications, 2008

2007

Discovering classes in microarray data using island counts.

[BibT_eX]

[DOI]

Louise C. Showe

Michael K. Showe

J. Comb. Optim., 2007

Approximating the fixed linear crossing number.

[BibT_eX]

[DOI]

Robert J. Cimikowski

Discret. Appl. Math., 2007

2006

Filtering Epitope Alignments to Improve Protein Surface Prediction.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of High Performance Computing and Networking, 2006

2004

Finding neural codes using random projections.

[BibT_eX]

[DOI]

Neurocomputing, 2004

Approximations for Two Decomposition-Based Geometric Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2004

2003

A New Method for Mapping Discontinuous Antibody Epitopes to Reveal Structural Features of Proteins.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Derivation of Natural Stimulus Feature Set Using a Data-Driven Model.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2003, 2003

Mapping Discontinuous Antibody Epitopes to Reveal Protein Structure and Changes in Structure Related to Function.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Revealing protein structures: a new method for mapping antibody epitopes.

[BibT_eX]

[DOI]

Brian W. Bailey

Edward A. Dratz

Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

2000

Probe location in the presence of errors: a problem from DNA mapping.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1997

Some computational problems from genomic mapping.

[BibT_eX]

[DOI]

PhD thesis, 1997

A Fast Heuristic Algorithm for a Probe Mapping Problem.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, 1997

A Model and Method for Detecting Errors in Data Sets.

[BibT_eX]

Proceedings of the German Conference on Bioinformatics, 1997

1995

Upper and Lower Bounds on Constructing Alphabetic Binary Trees.

[BibT_eX]

[DOI]

Maria M. Klawe

SIAM J. Discret. Math., 1995

1994

Finding friends-of-friends clusters quickly.

[BibT_eX]

[DOI]