Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Zongyi Peng, Yong Ma 0001, Yujie Zhang, Hao Li 0034, Fan Fan 0001, Xiaoguang Mei |
Seamless UAV Hyperspectral Image Stitching Using Optimal Seamline Detection via Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Geosci. Remote. Sens. ![In: IEEE Trans. Geosci. Remote. Sens. 61, pp. 1-13, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Pierre Bergé, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik |
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(2), pp. 964-996, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Felicia Lucke, Daniël Paulusma, Bernard Ries |
Finding Matching Cuts in H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3290-3322, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sariel Har-Peled, Mitchell Jones |
Few Cuts Meet Many Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 965-975, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Pierre Bergé, Lou Salaün |
The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 941, pp. 221-240, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Chayma Sakouhi, Abir Khaldi, Henda Ben Ghézala |
VSCT algorithm for graph partitioning based on volume, size, cuts and time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Emergent Distributed Syst. ![In: Int. J. Parallel Emergent Distributed Syst. 38(3), pp. 181-197, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mirjana Borisavljevic |
The Elimination of Maximum Cuts in Linear Logic and BCK Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 111(3), pp. 391-429, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Eliabelle Mauduit, Andrea Simonetto |
Constrained Hierarchical Clustering via Graph Coarsening and Optimal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.04209, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuxiao Cheng, Lianglong Li, Tingxiong Xiao, Zongren Li, Jinli Suo, Kunlun He, Qionghai Dai |
CUTS+: High-dimensional Causal Discovery from Irregular Time-series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.05890, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Steffan Christ Sølvsten, Jaco van de Pol |
Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.04488, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
Finding Diverse Minimum s-t Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.07290, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kyle Robinson, Dan Brown |
Automated Time-frequency Domain Audio Crossfades using Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.13380, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Brandon Du Preez |
Disconnected cuts in 4-connected planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.08355, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuxiao Cheng, Runzhao Yang, Tingxiong Xiao, Zongren Li, Jinli Suo, Kunlun He, Qionghai Dai |
CUTS: Neural Causal Discovery from Irregular Time-Series Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.07458, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Giacomo Cristinelli, José A. Iglesias, Daniel Walter |
Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.19777, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Leo Suchan, Housen Li, Axel Munk |
A scalable clustering algorithm to approximate graph cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09613, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yung H. Tsin |
On finding 2-cuts and 3-edge-connected components in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.14103, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.04624, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza |
On Conflict-Free Cuts: Algorithms and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.01077, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Diptapriyo Majumdar |
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.01286, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries |
Maximizing Matching Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.12960, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Isaac Wasserman, Jeová Farias Sales Rocha Neto |
Patch-Based Deep Unsupervised Image Segmentation using Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.01475, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Konstantin Makarychev, Liren Shan |
Random Cuts are Optimal for Explainable k-Medians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.09113, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Nate Veldt |
Cut-matching Games for Generalized Hypergraph Ratio Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.12274, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Leixin Ma, Mrunmayi Mungekar, Vwani Roychowdhury, Mohammad Khalid Jawed |
Rapid design of fully soft deployable structures via kirigami cuts and active learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.11295, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sara Mattia |
The follower optimality cuts for mixed integer linear bilevel programming problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 27(16), pp. 11529-11550, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Serhat Yüksel, Hasan Dinçer |
Sustainability analysis of digital transformation and circular industrialization with quantum spherical fuzzy modeling and golden cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 138, pp. 110192, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Eugenio Aulisa, Jonathon Loftin |
Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 94(1), pp. 315-350, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Andrea Lodi 0001, Mathieu Tanneau, Juan Pablo Vielma |
Disjunctive cuts in Mixed-Integer Conic Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 199(1), pp. 671-719, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano |
On the implementation and strengthening of intersection cuts for QCQPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 197(2), pp. 549-586, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Daniel Anderson, Guy E. Blelloch |
Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Parallel Comput. ![In: ACM Trans. Parallel Comput. 10(4), pp. 18:1-18:28, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mateja Sajna, Andrew Wagner |
Using edge cuts to find Euler tours and Euler families in hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(10), pp. 113537, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Aurélien Naldi, Adrien Richard, Elisa Tonello |
Linear cuts in Boolean networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 22(3), pp. 431-451, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yi Zhou 0010, Guillermo Gallego 0002, Xiuyuan Lu, Siqi Liu, Shaojie Shen |
Event-Based Motion Segmentation With Spatio-Temporal Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 34(8), pp. 4868-4880, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias |
Approximation algorithms for sorting by k-cuts on signed permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 45(1), pp. 6, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Cristian Ramirez-Pico, Ivana Ljubic, Eduardo Moreno 0001 |
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 57(5), pp. 1252-1275, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Erin W. Chambers, Jeff Erickson 0001, Kyle Fox, Amir Nayyeri |
Minimum Cuts in Surface Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 52(1), pp. 156-195, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
Finding Diverse Minimum s-t Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 24:1-24:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries |
Matching Cuts in Graphs of High Girth and H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 31:1-31:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg |
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings, pp. 14-28, 2023, Springer, 978-3-031-32725-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Aleksandr M. Kazachkov, Egon Balas |
Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings, pp. 275-290, 2023, Springer, 978-3-031-32725-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sariel Har-Peled, Da Wei Zheng |
Halving by a Thousand Cuts or Punctures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1385-1397, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
Maintaining Expander Decompositions via Sparse Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 48-69, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
Near-Linear Time Approximations for Cut Problems via Fair Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 240-275, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann |
Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOD (1) ![In: Machine Learning, Optimization, and Data Science - 9th International Conference, LOD 2023, Grasmere, UK, September 22-26, 2023, Revised Selected Papers, Part I, pp. 24-38, 2023, Springer, 978-3-031-53968-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Nate Veldt |
Cut-matching Games for Generalized Hypergraph Ratio Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the ACM Web Conference 2023, WWW 2023, Austin, TX, USA, 30 April 2023 - 4 May 2023, pp. 694-704, 2023, ACM, 978-1-4503-9416-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Baruch Schieber, Soroush Vahidi |
Approximating Connected Maximum Cuts via Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 93:1-93:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ijaz Ahmad 0002, Seokjoo Shin |
Noise-cuts-Noise Approach for Mitigating the JPEG Distortions in Deep Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAIIC ![In: International Conference on Artificial Intelligence in Information and Communication, ICAIIC 2023, Bali, Indonesia, February 20-23, 2023, pp. 221-226, 2023, IEEE, 978-1-6654-5645-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Steffan Christ Sølvsten, Jaco van de Pol |
Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis - 21st International Symposium, ATVA 2023, Singapore, October 24-27, 2023, Proceedings, Part II, pp. 72-92, 2023, Springer, 978-3-031-45331-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Eliabelle Mauduit, Andrea Simonetto |
Constrained Hierarchical Clustering via Graph Coarsening and Optimal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSSC ![In: 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29 - Nov. 1, 2023, pp. 844-848, 2023, IEEE, 979-8-3503-2574-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Pablo Luiz Braga Soares, Carlos Victor Dantas Araújo |
Genetic Algorithms with Optimality Cuts to the Max-Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BRACIS (3) ![In: Intelligent Systems - 12th Brazilian Conference, BRACIS 2023, Belo Horizonte, Brazil, September 25-29, 2023, Proceedings, Part III, pp. 17-32, 2023, Springer, 978-3-031-45391-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 172-186, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Davi Magalhães Pereira, Marcelo Bernardes Vieira, Saulo Moraes Villela |
Graph Cuts and Deep Neural Networks for Fire Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: 36th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2003, Rio Grande, RS, Brazil, November 6-9, 2023, pp. 79-84, 2023, IEEE, 979-8-3503-3873-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuan-Hsiang Teng, Tzu-Liang Kung |
Vulnerability of the Hypercube Network Based on P2-cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMIS ![In: Innovative Mobile and Internet Services in Ubiquitous Computing - Proceedings of the 17th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2023), Toronto, ON, Canada, 5-7 July 2023., pp. 221-228, 2023, Springer, 978-3-031-35835-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Quentin Lebon, Josselin Lefèvre, Jean Cousty, Benjamin Perret |
Interactive Segmentation with Incremental Watershed Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 26th Iberoamerican Congress, CIARP 2023, Coimbra, Portugal, November 27-30, 2023, Proceedings, Part I, pp. 189-200, 2023, Springer, 978-3-031-49017-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Neeldhara Misra, Yash More |
Finding Perfect Matching Cuts Faster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings, pp. 307-318, 2023, Springer, 978-3-031-34346-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Noelia Faginas Lago, Emília Valença Ferreira de Aragão, Luca Mancini, Marzio Rosi, Daniela Ascenzi, Fernando Pirani |
Coding Cross Sections of an Electron Charge Transfer Process: Analysis of Different Cuts for the Entrance and Exit Potentials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (Workshops 8) ![In: Computational Science and Its Applications - ICCSA 2023 Workshops - Athens, Greece, July 3-6, 2023, Proceedings, Part VIII, pp. 162-175, 2023, Springer, 978-3-031-37125-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Li Chen 0028, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
A Simple Framework for Finding Balanced Sparse Cuts via APSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023, pp. 42-55, 2023, SIAM, 978-1-61197-758-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Approximate minimum cuts and their enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023, pp. 36-41, 2023, SIAM, 978-1-61197-758-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Daniel Thuerck, Boro Sofranac, Marc E. Pfetsch, Sebastian Pokutta |
Learning Cuts via Enumeration Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Konstantin Makarychev, Liren Shan |
Random Cuts are Optimal for Explainable k-Medians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Boris Chen, Amir Ziai, Rebecca S. Tucker, Yuchen Xie |
Match Cutting: Finding Cuts with Smooth Visual Transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WACV ![In: IEEE/CVF Winter Conference on Applications of Computer Vision, WACV 2023, Waikoloa, HI, USA, January 2-7, 2023, pp. 2114-2124, 2023, IEEE, 978-1-6654-9346-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuxiao Cheng, Runzhao Yang, Tingxiong Xiao, Zongren Li, Jinli Suo, Kunlun He, Qionghai Dai |
CUTS: Neural Causal Discovery from Irregular Time-Series Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Anthony Angone, Xiaoyuan Liu 0001, Ruslan Shaydulin, Ilya Safro |
Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPEC ![In: IEEE High Performance Extreme Computing Conference, HPEC 2023, Boston, MA, USA, September 25-29, 2023, pp. 1-7, 2023, IEEE, 979-8-3503-0860-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Tim Varelmann, Adrian W. Lipow, Michael Baldea, Alexander Mitsos |
Advanced feasibility cuts in decoupled cooperative optimization of power flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Chem. Eng. ![In: Comput. Chem. Eng. 157, pp. 107635, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Joseph Warrington |
Transfer Learning for Constrained Stochastic Control Using Adjustable Benders Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Control. Syst. Lett. ![In: IEEE Control. Syst. Lett. 6, pp. 163-168, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mateo Leco, Thomas McLeay, Visakan Kadirkamanathan |
A two-step machining and active learning approach for right-first-time robotic countersinking through in-process error compensation and prediction of depth of cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robotics Comput. Integr. Manuf. ![In: Robotics Comput. Integr. Manuf. 77, pp. 102345, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nguyen Thanh Binh 0004, Nguyen Mong Hien, Dang Thanh Tin |
Improving U-Net architecture and graph cuts optimization to classify arterioles and venules in retina fundus images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 42(4), pp. 4015-4026, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jonathan K. Stelter, Christof Boehm, Stefan Ruschke, Kilian Weiss, Maximilian N. Diefenbach, Mingming Wu, Tabea Borde, Georg P. Schmidt, Marcus R. Makowski, Eva M. Fallenberg, Dimitrios C. Karampinos |
Hierarchical Multi-Resolution Graph-Cuts for Water-Fat-Silicone Separation in Breast MRI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 41(11), pp. 3253-3265, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Oliviana Xavier do Nascimento, Thiago Alves de Queiroz, Leonardo Junqueira |
A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 316(2), pp. 805-835, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Rui Chen, James R. Luedtke |
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 34(4), pp. 2332-2349, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Carol T. Zamfirescu |
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 174, pp. 106192, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pawel Marcin Kozyra |
An Innovative and Very Efficient Algorithm for Searching All Multistate Minimal Cuts Without Duplicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 71(1), pp. 390-403, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yi-Fen Chen, Chia-Wen Tsai, Priscilia Vanessa Kuswanto |
Impact of Premium and Price Cuts on Consumer Purchase Intention: Comparison Between Taiwan and Indonesia. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Technol. Hum. Interact. ![In: Int. J. Technol. Hum. Interact. 18(1), pp. 1-26, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zeren Huang, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang 0001, Mingxuan Yuan, Jianye Hao, Yong Yu 0001, Jun Wang 0012 |
Learning to select cuts for efficient mixed-integer programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. ![In: Pattern Recognit. 123, pp. 108353, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jens Vinther Clausen, Richard Lusby, Stefan Ropke |
Consistency Cuts for Dantzig-Wolfe Reformulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 70(5), pp. 2883-2905, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhaobin Wang, Xiong Gao, Runliang Wu, Jianfang Kang, Yaonan Zhang |
Fully automatic image segmentation based on FCN and graph cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Syst. ![In: Multim. Syst. 28(5), pp. 1753-1765, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Hongjun Li, Fanyu Kong, Jia Yu 0005 |
Secure Outsourcing for Normalized Cuts of Large-Scale Dense Graph in Internet of Things. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Things J. ![In: IEEE Internet Things J. 9(14), pp. 12711-12722, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mingchun Li, Dali Chen, Shixin Liu |
Weakly Supervised Segmentation Loss Based on Graph Cuts and Superpixel Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 54(3), pp. 2339-2362, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Celia Andreu-Sánchez, Miguel Ángel Martín-Pascual, Agnès Gruart, José María Delgado-García |
Brain Symmetry in Alpha Band When Watching Cuts in Movies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(10), pp. 1980, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shazia Rana, Muhammad Haris Saeed, Badria Almaz Ali Yousif, Florentin Smarandache, Hamiden Abd El-Wahed Khalifa |
Time-Leveled Hypersoft Matrix, Level Cuts, Operators, and COVID-19 Collective Patient Health State Ranking Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Comput. Intell. Soft Comput. ![In: Appl. Comput. Intell. Soft Comput. 2022, pp. 2388284:1-2388284:14, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nirmal S. Nair, Madhu S. Nair |
Multi-View Stereo Using Graph Cuts-Based Depth Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Signal Process. Lett. ![In: IEEE Signal Process. Lett. 29, pp. 1903-1907, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Vahid Khalilpour Akram |
Distributed Detection of Minimum Cuts in Wireless Multi-Hop Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 71(4), pp. 919-932, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Masahiro Ikeda, Atsushi Miyauchi 0001, Yuuki Takai, Yuichi Yoshida |
Finding Cheeger cuts in hypergraphs via heat equation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 930, pp. 1-23, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Matthias Bentert, Klaus Heeger, Dusan Knop |
Length-bounded cuts: Proper interval graphs and structural parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 126, pp. 21-43, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Junaid Malik, Serkan Kiranyaz, Riyadh Al-Raoush, Olivier Monga, Patricia Garnier, Sebti Foufou, Abdelaziz Bouras, Alexandros Iosifidis, Moncef Gabbouj, Philippe C. Baveye |
3D Quantum Cuts for automatic segmentation of porous media in tomography images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geosci. ![In: Comput. Geosci. 159, pp. 105017, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nate Veldt, Austin R. Benson, Jon M. Kleinberg |
Hypergraph Cuts with General Splitting Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM Rev. ![In: SIAM Rev. 64(3), pp. 650-685, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Dimosthenis Pasadakis, Christie Louis Alappat, Olaf Schenk, Gerhard Wellein |
Multiway p-spectral graph cuts on Grassmann manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 111(2), pp. 791-829, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak |
Computational Short Cuts in Infinite Domain Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 75, pp. 793-831, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pavlo Glushko, Csaba I. Fábián, Achim Koberstein |
An L-shaped method with strengthened lift-and-project cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Manag. Sci. ![In: Comput. Manag. Sci. 19(4), pp. 539-565, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros |
An Anti-Ramsey Theorem of k-Restricted Edge-Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(4), pp. 125, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer |
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 66(5), pp. 1019-1045, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mirjana Borisavljevic |
Maximum Segments as Natural Deduction Images of Some Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logica Universalis ![In: Logica Universalis 16(3), pp. 499-533, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza |
Perfect matching cuts partitioning a graph into complementary subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.06714, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Merav Parter, Asaf Petruschka |
Near-Optimal Distributed Computation of Small Vertex Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.09415, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ítalo Santana, Breno Serrano, Maximilian Schiffer, Thibaut Vidal |
Support Vector Machines with the Hard-Margin Loss: Optimal Training via Combinatorial Benders' Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.07690, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sariel Har-Peled, Da Wei Zheng |
Halving by a Thousand Cuts or Punctures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.11275, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohit Daga |
Edge-Cuts and Rooted Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.13320, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Felicia Lucke, Daniël Paulusma, Bernard Ries |
Finding Matching Cuts in H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.07095, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik |
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.07312, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|