Остановите войну!
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 117 matches
- 2024
- Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang:
DSLS: a simple and efficient local search algorithm for the maximum bisection problem. J. Heuristics 30(1): 43-65 (2024) - 2023
- Ahmed El Alaoui, Andrea Montanari, Mark Sellke:
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. Random Struct. Algorithms 63(3): 689-715 (2023) - 2022
- Carlos Soto, Eduardo Del Ángel-Martínez, Héctor Joaquín Fraire Huacuja, Bernabé Dorronsoro, Nelson Rangel-Valdez, Laura Cruz Reyes:
Two novel branch and bound algorithms for the vertex bisection problem. Expert Syst. Appl. 190: 116169 (2022) - Xinliang Tian, Dantong Ouyang, Rui Sun, Huisi Zhou, Liming Zhang:
Two efficient local search algorithms for the vertex bisection minimization problem. Inf. Sci. 609: 153-171 (2022) - 2021
- Aesha N. Elghandour, Ahmed M. Salah, Yasser A. Elmasry, Abdelrahman A. Karawia:
An Image Encryption Algorithm Based on Bisection Method and One-Dimensional Piecewise Chaotic Map. IEEE Access 9: 43411-43421 (2021) - Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83(6): 1861-1884 (2021) - Shicong Jiang, Chuangyin Dang:
A more efficient deterministic annealing neural network algorithm for the max-bisection problem. Neurocomputing 458: 428-439 (2021) - Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. 873: 38-46 (2021) - Eric Barnett, Clément Gosselin:
A Bisection Algorithm for Time-Optimal Trajectory Planning Along Fully Specified Paths. IEEE Trans. Robotics 37(1): 131-145 (2021) - Hauke Brinkop, Klaus Jansen, Tim Weißenfels:
An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv. CoRR abs/2101.00694 (2021) - Fatih Idiz:
A Bisection Method Like Algorithm for Approximating Extrema of a Continuous Function. CoRR abs/2108.12514 (2021) - Ahmed El Alaoui, Andrea Montanari, Mark Sellke:
Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree. CoRR abs/2111.06813 (2021) - 2020
- Caixia Kou, Dedong Hu, Jianhua Yuan, Wenbao Ai:
Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem. IEEE/ACM Trans. Netw. 28(1): 224-233 (2020) - Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW 2020: 25-36 - Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR abs/2002.12706 (2020) - 2019
- Yan Lin, Qiaoqiao Xia, Wenwu He, Qinglin Zhang:
A Fast Iterative Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes by Bisection Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(10): 1406-1410 (2019) - Jesús David Terán Villanueva, Héctor Joaquín Fraire Huacuja, Salvador Ibarra-Martínez, Laura Cruz Reyes, José A. Castán-Rocha, Claudia Gómez Santillán, Julio Laria-Menchaca:
Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design. Inf. Sci. 478: 62-82 (2019) - Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS 2019: 28:1-28:14 - 2018
- Michael Hamann, Ben Strasser:
Graph Bisection with Pareto Optimization. ACM J. Exp. Algorithmics 23 (2018) - Zoran Maksimovic, Jozef Kratica, Aleksandar Savic, Dragan Matic:
Solving the Multidimensional Maximum Bisection Problem by a Genetic Algorithm and Variable Neighborhood Search. J. Multiple Valued Log. Soft Comput. 31(4): 323-358 (2018) - Abdelkrim El Mouatasim:
Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation. Numer. Algorithms 78(1): 41-62 (2018) - Hassan AbouEisha, Victor M. Calo, Konrad Jopek, Mikhail Moshkov, Anna Paszynska, Maciej Paszynski:
Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids. ICCS (2) 2018: 760-772 - Mohammad Bakhshalipour, Hamid Sarbazi-Azad:
Parallelizing Bisection Root-Finding: A Case for Accelerating Serial Algorithms in Multicore Substrates. CoRR abs/1805.07269 (2018) - 2017
- Christer Samuelsson:
The Revised Stochastic Simplex Bisection Algorithm and Particle Swarm Optimization. FedCSIS (Communication Papers) 2017: 103-110 - Adrian Bekasiewicz, Slawomir Koziel, Leifur Leifsson, Xiaosong Du:
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces. ICCS 2017: 1453-1462 - 2016
- Pallavi Jain, Gur Saran, Kamal Srivastava:
On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369: 765-787 (2016) - Per Austrin, Siavosh Benabbas, Konstantinos Georgiou:
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. ACM Trans. Algorithms 13(1): 2:1-2:27 (2016) - Minseok Kang, Ji-Hoon Bae, Byung-Soo Kang, Kyung-Tae Kim:
ISAR Cross-Range Scaling Using Iterative Processing via Principal Component Analysis and Bisection Algorithm. IEEE Trans. Signal Process. 64(15): 3909-3918 (2016) - Robert Krauthgamer:
Minimum Bisection. Encyclopedia of Algorithms 2016: 1294-1297 - 2015
- Andreas Emil Feldmann, Peter Widmayer:
An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015)
skipping 87 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-25 12:11 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