News for the Publication Category: Theoretical Computer Science News Archives: Select Month April 2024 (3) March 2024 (2) February 2024 (2) January 2024 (3) December 2023 (2) November 2023 (3) October 2023 (6) September 2023 (3) August 2023 (2) July 2023 (4) June 2023 (1) May 2023 (6) April 2023 (4) March 2023 (5) February 2023 (6) December 2022 (4) October 2022 (1) September 2022 (2) July 2022 (2) June 2022 (2) May 2022 (4) April 2022 (1) March 2022 (6) February 2022 (3) December 2021 (1) November 2021 (1) October 2021 (4) September 2021 (2) August 2021 (1) June 2021 (1) May 2021 (3) April 2021 (7) March 2021 (4) February 2021 (5) January 2021 (1) December 2020 (2) November 2020 (2) October 2020 (1) August 2020 (2) July 2020 (1) June 2020 (2) May 2020 (2) April 2020 (5) March 2020 (2) February 2020 (3) January 2020 (1) December 2019 (4) November 2019 (4) October 2019 (4) September 2019 (5) August 2019 (1) July 2019 (3) May 2019 (3) April 2019 (6) March 2019 (5) February 2019 (7) January 2019 (2) December 2018 (1) November 2018 (4) October 2018 (6) September 2018 (6) August 2018 (5) July 2018 (1) June 2018 (3) May 2018 (4) April 2018 (8) March 2018 (7) February 2018 (3) January 2018 (2) December 2017 (2) November 2017 (2) August 2017 (2) June 2017 (1) February 2017 (3) January 2017 (4) November 2016 (5) October 2016 (1) September 2016 (1) August 2016 (4) July 2016 (1) June 2016 (3) May 2016 (2) April 2016 (3) March 2016 (4) February 2016 (3) January 2016 (1) November 2015 (2) October 2015 (2) September 2015 (2) August 2015 (2) July 2015 (1) June 2015 (1) May 2015 (3) April 2015 (1) March 2015 (1) February 2015 (1) January 2015 (1) December 2014 (5) November 2014 (2) October 2014 (2) September 2014 (3) August 2014 (1) February 2014 (1) January 2014 (3) November 2013 (7) Search News: Labeled cuts in graphs Lenwood Heath, Madhav Marathe In Theoretical Computer Science, 648 : 34-39, 10/2016 Citatations: BibTeX