Остановите войну!
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 774 matches
- 2024
- Khadija Aslam, Faiza Iqbal, Ayesha Altaf, Naveed Hussain, Mónica Gracia Villar, Emmanuel Soriano Flores, Isabel de la Torre Díez, Imran Ashraf:
Detecting Pragmatic Ambiguity in Requirement Specification Using Novel Concept Maximum Matching Approach Based on Graph Network. IEEE Access 12: 15651-15661 (2024) - Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica 86(3): 717-734 (2024) - Moran Feldman, Ariel Szarf:
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. Algorithmica 86(4): 1173-1209 (2024) - Chao Shi, Tianlong Ma:
A note on maximum size of a graph without isolated vertices under the given matching number. Appl. Math. Comput. 460: 128295 (2024) - Yuxuan Liu, Leilei Zhang:
The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number. Discret. Math. 347(1): 113734 (2024) - Pablo Pérez-Lantero, Carlos Seara:
Center of maximum-sum matchings of bichromatic points. Discret. Math. 347(3): 113822 (2024) - Vasily Alferov, Ivan Bliznets, Kirill Brilliantov:
Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. AAAI 2024: 7918-7925 - Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA 2024: 2185-2235 - Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA 2024: 4062-4082 - Christian Konrad, Kheeran K. Naidu:
An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. SODA 2024: 2881-2899 - Sepehr Assadi:
A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. SOSA 2024: 337-354 - Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan:
A Bisection Approach to Subcubic Maximum Induced Matching. WALCOM 2024: 257-272 - Oscar Chacón-Rivera, Pablo Pérez-Lantero:
On maximum-sum matchings of bichromatic points. CoRR abs/2403.08977 (2024) - Yasuko Kawahata:
Repetitive Dilemma Games in Distribution Information Using Interplay of Droop Quota: Meek's Method in Impact of Maximum Compensation and Minimum Cost Routes in Information Role of Marginal Contribution in Two-Sided Matching Markets. CoRR abs/2403.18837 (2024) - 2023
- Weiqi Zhai, Xiaodi Huang, Nan Shen, Shanfeng Zhu:
Phen2Disease: a phenotype-driven model for disease and gene prioritization by bidirectional maximum matching semantic similarities. Briefings Bioinform. 24(4) (2023) - Jiangyue Zhang, Yan Wu, Heping Zhang:
The maximum matching extendability and factor-criticality of 1-planar graphs. Discret. Appl. Math. 338: 247-254 (2023) - Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70(3): 550-579 (2023) - Sevak Abrahamyan:
On maximum matchings in 5-regular and 6-regular multigraphs. Discret. Math. 346(2): 113243 (2023) - Lars Jaffke, Paloma T. Lima:
On the maximum number of edges in planar graphs of bounded degree and matching number. Discret. Math. 346(8): 113431 (2023) - Yanjia Li, Sophie Spirkl:
The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. Discret. Math. 346(4): 113342 (2023) - Chang Liu, Zimo Yan, Jianping Li:
The maximum Aα-spectral radius of t-connected graphs with bounded matching number. Discret. Math. 346(7): 113447 (2023) - Zana Kovijanic Vukicevic:
Enumeration of maximum matchings in the Hanoi graphs using matching polynomials. Discret. Math. Algorithms Appl. 15(7): 2250160:1-2250160:8 (2023) - Nicolas Nisse, Alexandre Salch, Valentin Weber:
Recovery of disrupted airline operations using k-maximum matching in graphs. Eur. J. Oper. Res. 309(3): 1061-1072 (2023) - Matthias Soppert, Claudius Steinhardt, Christian Müller, Jochen Gönsch, Prasanna M. Bhogale:
Matching functions for free-floating shared mobility system optimization to capture maximum walking distances. Eur. J. Oper. Res. 305(3): 1194-1214 (2023) - Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong:
On maximum bipartite matching with separation. Inf. Process. Lett. 182: 106388 (2023) - Chunlei Xu, Guanru Li:
Maximum values of sombor index of bicyclic graphs with a given matching number. RAIRO Theor. Informatics Appl. 57: 11 (2023) - George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
On maximum-sum matchings of points. J. Glob. Optim. 85(1): 111-128 (2023) - M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan:
Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks 81(4): 465-489 (2023) - Haram Kim, Sangil Lee, Junha Kim, H. Jin Kim:
Real-Time Hetero-Stereo Matching for Event and Frame Camera With Aligned Events Using Maximum Shift Distance. IEEE Robotics Autom. Lett. 8(1): 416-423 (2023)
skipping 744 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-16 07:54 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