-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
harsha
committed
May 8, 2024
1 parent
e1b7511
commit d2bedd0
Showing
3 changed files
with
27 additions
and
24 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,16 +1,17 @@ | ||
@article{LOpt_TCNS2024, | ||
title={Optimal Robust Network Design: Formulations and Algorithms for Maximizing Algebraic Connectivity}, | ||
author={Somisetty, Neelkamal and Nagarajan, Harsha and Darbha, Swaroop}, | ||
journal={IEEE Transactions on Control of Network Systems (accepted)}, | ||
url = {https://arxiv.org/abs/2304.08571}, | ||
year={2024}, | ||
publisher={IEEE} | ||
} | ||
|
||
@inproceedings{LOpt_ECC2015, | ||
title={On maximizing algebraic connectivity of networks for various engineering applications}, | ||
author={Nagarajan, Harsha and Rathinam, Sivakumar and Darbha, Swaroop}, | ||
booktitle={European Control Conference (ECC)}, | ||
pages={1626--1632}, | ||
year={2015}, | ||
organization={IEEE} | ||
} | ||
|
||
@article{LOpt_arXiv2023, | ||
title={Optimal Robust Network Design: Formulations and Algorithms for Maximizing Algebraic Connectivity}, | ||
author={Somisetty, Neelkamal and Nagarajan, Harsha and Darbha, Swaroop}, | ||
journal={arXiv preprint:2304.08571}, | ||
url = {https://arxiv.org/abs/2304.08571}, | ||
year={2023} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters