Author of the publication

Cost-Effective Live Expansion of Three-Stage Switching Networks without Blocking or Connection Rearrangement.

, , and . INFOCOM, page 1-10. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient Algorithms for Airline Problem., , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 428-439. Springer, (2007)Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem., , , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 452-462. Springer, (2011)Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph., , , and . Discovery Science, volume 8140 of Lecture Notes in Computer Science, page 308-323. Springer, (2013)Listing Maximal Independent Sets with Minimal Space and Bounded Delay., , , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 144-160. Springer, (2017)Counting the number of independent sets in chordal graphs., , and . J. Discrete Algorithms, 6 (2): 229-242 (2008)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , and . Theor. Comput. Sci., (2021)Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)Single versus Multiple Sorting in All Pairs Similarity Search., , , and . ACML, volume 13 of JMLR Proceedings, page 145-160. JMLR.org, (2010)Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph., , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 150-161. Springer, (2017)