Faculty

Institution

Unit

Venue

Balaji Raghavachari

Professor

University of Texas at Dallas

Affiliations

Erik Jonsson School of Engineering and Computer Science

Computer Science

Electrical and Computer Engineering

Balaji Raghavachari is currently serving as a Computer Science Professor at University of Texas At Dallas.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Balaji Raghavachari

University of Texas at Dallas

Professor

You can click a keyword to filter the displayed items

applied mathematics computer science graph theory machine learning systems engineering mathematical optimization approximation algorithms discrete mathematics network analysis approximation theory informatics formal methods computational optimization discrete algorithms information technology wireless communications vehicle routing problems graphology electrical engineering bioinformatics distributed systems graph analysis empirical algorithmics discrete optimization scheduling problems information processing (psychology) multicast straight-line grid embeddings localization lightwave technology logic in computer science combinatorial optimization telecommunication networks numerical algorithms applied linguistics networked system design mobile computing communication security domain theory bioinformatics database structural bioinformatics protein bioinformatics optimization problems algorithm engineering algorithm design discrete modeling discrete geometry structure discovery remote operation parallel processing interconnection networks network algorithms complexity theory information propagation applied algebra intergroup relations group communication wireless security network routing network security network routing algorithm physical layer shortest-path trees minimum spanning trees minimum-degree steiner tree comprehensive collection domain-domain interactions uniform connectivity problems protein domain interactions optimal degree bounded performance guarantees minimum equivalent digraph small weight network-flow technique network design bounded cycle length operations research design optimization

Notable Scholarly Works

Notable Federal Grants

Collaborators

Basic Graph Algorithms. Springer eBooks (2017)

KwangSoo YangShashi Shekhar

graph theorybasic graph algorithmsapplied mathematics

Graph Connectivity. Encyclopedia of Algorithms (2016)

Samir KhullerBalaji Raghavachari

network analysismachine learninggraph theorygraph connectivitynetwork sciencegraphologycomputer science

Network Optimization. Springer eBooks (2013)

Thomas L. Magnanti

network optimizationcomputer sciencenetwork science

A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. (2010)

Shengli YuanBalaji RaghavachariLei Chen

systems engineeringmobile computingcommunication securitydistributed systemscomputer securitywireless communicationsnetwork traffic controlnetwork securitythreat-aware routing algorithminformation securitynetworked system designnetwork routing algorithmnetwork routingphysical layer

DOMINE: A Comprehensive Collection of Known and Predicted Domain-Domain Interactions. Nucleic Acids Research (2010)

Sailu YellaboinaAsba TasneemDmitri V. ZaykinBalaji RaghavachariRaja Jothi

domain-domain interactionscomprehensive collectiondomain theorymolecular biologybioinformatics

Finding Maximum Reliable Path in Mesh Networks Under Multiple Failures. (2010)

Shengli YuanBalaji RaghavachariAnkitkumar Patel

maximum reliable pathsystems engineeringmachine learningmultiple failures

Advanced Combinatorial Algorithms. Chapman & Hall/CRC applied algorithms and data structures series (2009)

Samir KhullerBalaji Raghavachari

machine learningadvanced combinatorial algorithmsapplied mathematics

Improved Approximation Algorithms for the Single-Sink Buy-At-Bulk Network Design Problems. Journal of Discrete Algorithms (2009)

Raja JothiBalaji Raghavachari

formal methodsmathematical optimizationapproximation algorithmsapplied mathematics

Degree-Bounded Minimum Spanning Trees. Discrete Applied Mathematics (2008)

Raja JothiBalaji Raghavachari

discrete geometrydiscrete mathematicsdiscrete algorithmsapplied mathematics

A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. Lecture notes in computer science (2007)

Prabhakar GubbalaBalaji Raghavachari

technologycomputational optimizationtelecommunication networksnumerical algorithmsmathematical optimizationnetwork algorithmscomputer engineeringcomplexity theoryinterconnection networkswireless networkscomputer scienceedge computing

1
2
3
4
5
6
10 / page

Balaji Raghavachari

Professor

University of Texas at Dallas

Affiliations

Erik Jonsson School of Engineering and Computer Science

Computer Science

Electrical and Computer Engineering

Balaji Raghavachari is currently serving as a Computer Science Professor at University of Texas At Dallas.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Balaji Raghavachari

University of Texas at Dallas

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Basic Graph Algorithms. Springer eBooks (2017)

KwangSoo YangShashi Shekhar

graph theorybasic graph algorithmsapplied mathematics

Graph Connectivity. Encyclopedia of Algorithms (2016)

Samir KhullerBalaji Raghavachari

network analysismachine learninggraph theorygraph connectivitynetwork sciencegraphologycomputer science

Network Optimization. Springer eBooks (2013)

Thomas L. Magnanti

network optimizationcomputer sciencenetwork science

A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. (2010)

Shengli YuanBalaji RaghavachariLei Chen

DOMINE: A Comprehensive Collection of Known and Predicted Domain-Domain Interactions. Nucleic Acids Research (2010)

Sailu YellaboinaAsba TasneemDmitri V. ZaykinBalaji RaghavachariRaja Jothi

domain-domain interactionscomprehensive collectiondomain theorymolecular biologybioinformatics

Finding Maximum Reliable Path in Mesh Networks Under Multiple Failures. (2010)

Shengli YuanBalaji RaghavachariAnkitkumar Patel

maximum reliable pathsystems engineeringmachine learningmultiple failures

Advanced Combinatorial Algorithms. Chapman & Hall/CRC applied algorithms and data structures series (2009)

Samir KhullerBalaji Raghavachari

machine learningadvanced combinatorial algorithmsapplied mathematics

Improved Approximation Algorithms for the Single-Sink Buy-At-Bulk Network Design Problems. Journal of Discrete Algorithms (2009)

Raja JothiBalaji Raghavachari

formal methodsmathematical optimizationapproximation algorithmsapplied mathematics

Degree-Bounded Minimum Spanning Trees. Discrete Applied Mathematics (2008)

Raja JothiBalaji Raghavachari

discrete geometrydiscrete mathematicsdiscrete algorithmsapplied mathematics

A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. Lecture notes in computer science (2007)

Prabhakar GubbalaBalaji Raghavachari

1
2
3
4
5
6
10 / page

Similar Faculty Members

Serge Plotkin

Institution

Stanford University

discrete algorithm

network routing

Esther Arkin

Institution

Stony Brook University

discrete algorithm

operations research

Daniel Sleator

Institution

Carnegie Mellon University

algorithms

computer communications

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ashish Goel

Institution

Stanford University

algorithm design

network algorithm

Weili Wu

Institution

University of Texas at Dallas

data management

pattern mining

Bhaskar DasGupta

Institution

University of Illinois Chicago

network science

philosophy of computer science

Gruia Calinescu

Institution

Illinois Institute of Technology

discrete algorithm

analysis of algorithm

Benjamin Moseley

Institution

Carnegie Mellon University

numerical mathematics

general systems

Samir Khuller

Institution

University of Maryland, College Park

parallel complexity theory

combinatorial optimization

Similar Faculty Members

Serge Plotkin

Institution

Stanford University

discrete algorithm

network routing

Esther Arkin

Institution

Stony Brook University

discrete algorithm

operations research

Daniel Sleator

Institution

Carnegie Mellon University

algorithms

computer communications

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ashish Goel

Institution

Stanford University

algorithm design

network algorithm

Weili Wu

Institution

University of Texas at Dallas

data management

pattern mining

Bhaskar DasGupta

Institution

University of Illinois Chicago

network science

philosophy of computer science

Gruia Calinescu

Institution

Illinois Institute of Technology

discrete algorithm

analysis of algorithm

Benjamin Moseley

Institution

Carnegie Mellon University

numerical mathematics

general systems

Samir Khuller

Institution

University of Maryland, College Park

parallel complexity theory

combinatorial optimization