Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 79 matches
- 2024
- Elham Ramzani Ghalebala, Massoud Aman, Nasim Nasrabadi:
A Weighted Inverse Minimum s - t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance. Asia Pac. J. Oper. Res. 41(1): 2350009:1-2350009:22 (2024) - Hassene Aissi, Ali Ridha Mahjoub:
On the minimum s-t cut problem with budget constraints. Math. Program. 203(1): 421-442 (2024) - Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. SODA 2024: 1503-1541 - Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. CoRR abs/2401.10856 (2024) - 2023
- Pierre Bergé, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik:
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts. SIAM J. Discret. Math. 37(2): 964-996 (2023) - Surender Baswana, Koustav Bhanja, Abhyuday Pandey:
Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle. ACM Trans. Algorithms 19(4): 38:1-38:41 (2023) - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. ISAAC 2023: 24:1-24:17 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. CoRR abs/2303.07290 (2023) - 2022
- Surender Baswana, Koustav Bhanja, Abhyuday Pandey:
Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. ICALP 2022: 15:1-15:20 - 2021
- Xinxin Li, Ting Kei Pong, Hao Sun, Henry Wolkowicz:
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem. Comput. Optim. Appl. 78(3): 853-891 (2021) - Simon Apers, Troy Lee:
Quantum Complexity of Minimum Cut. CCC 2021: 28:1-28:33 - Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - Simon Apers, Arinta Auza, Troy Lee:
A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs. CoRR abs/2110.15587 (2021) - Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - 2020
- Vahid Khalilpour Akram:
An Asynchronous Distributed Algorithm for Minimum s-t Cut Detection in Wireless Multi-hop Networks. Ad Hoc Networks 101: 102092 (2020) - Peng Zhang, Linqing Tang:
Minimum Label s-t Cut has large integrality gaps. Inf. Comput. 275: 104543 (2020) - Eric Chang, Chung-Kuan Cheng, Anushka Gupta, Po-Ya Hsu, Amanda Moffitt, Alissa Ren, Irene Tsaur, Samuel Wang:
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs. Networks 76(1): 106-121 (2020) - Steffen Rebennack, Oleg A. Prokopyev, Bismark Singh:
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms. Networks 75(3): 235-258 (2020) - Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO 2020: 27-39 - Peng Zhang:
Approximating the Weighted Minimum Label s-t Cut Problem. CoRR abs/2011.06204 (2020) - 2019
- Wai Sze Yip, Suet To:
Reduction of Minimum Cutting Thickness of Titanium Alloys in Micro Cutting by a Magnetic Field Assistance. IEEE Access 7: 152034-152041 (2019) - Augusto Bordini, Fábio Protti, Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho:
New algorithms for the minimum coloring cut problem. Int. Trans. Oper. Res. 26(5): 1868-1883 (2019) - Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. WG 2019: 79-92 - Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Luiz Satoru Ochi, Philippe Michelon, Serigne Gueye, Lucídio A. F. Cabral:
Solving the minimum labeling global cut problem by mathematical programming. CoRR abs/1903.04319 (2019) - Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-parameter tractability of counting small minimum (S, T)-cuts. CoRR abs/1907.02353 (2019) - Peng Zhang, Linqing Tang:
Minimum Label s-t Cut has Large Integrality Gaps. CoRR abs/1908.11491 (2019) - Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR abs/1911.11847 (2019) - 2018
- Peng Zhang, Bin Fu, Linqing Tang:
Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem. Algorithmica 80(1): 398-409 (2018) - Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Igor A. M. Barbosa, Nenad Mladenovic, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Daniel Aloise:
Efficient heuristics for the minimum labeling global cut problem. Electron. Notes Discret. Math. 66: 23-30 (2018)
skipping 49 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-24 16:44 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint