Остановите войну!
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
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 76 matches
- 2024
- Péter Biró, Sándor Bozóki, Tamás Király, Alexandru Kristály:
Optimization methods and algorithms. Central Eur. J. Oper. Res. 32(1): 1-9 (2024) - Tamás Molnár, Géza Király:
Forest Disturbance Monitoring Using Cloud-Based Sentinel-2 Satellite Imagery and Machine Learning. J. Imaging 10(1): 14 (2024) - Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27(2): 151-164 (2024) - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR abs/2402.10861 (2024) - 2023
- Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
On the complexity of packing rainbow spanning trees. Discret. Math. 346(4): 113297 (2023) - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai:
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180: 106340 (2023) - Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. J. Comb. Theory, Ser. A 194: 105697 (2023) - Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37(2): 1311-1330 (2023) - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA 2023: 103-113 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR abs/2307.08555 (2023) - 2022
- Gergo Gombos, Dávid Kis, Lilla Tóthmérész, Tamás Király, Szilveszter Nádas, Sándor Laki:
Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology. IEEE Access 10: 120312-120328 (2022) - Tamás Király, Yu Yokoi:
Equitable partitions into matchings and coverings in mixed graphs. Discret. Math. 345(1): 112651 (2022) - Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory, Ser. B 157: 294-345 (2022) - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022) - Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910: 48-53 (2022) - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. SODA 2022: 103-123 - Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. CoRR abs/2202.04371 (2022) - Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
Manipulating the outcome of stable matching and roommates problems. CoRR abs/2204.13485 (2022) - Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
On the complexity of packing rainbow spanning trees. CoRR abs/2206.11924 (2022) - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. CoRR abs/2208.09583 (2022) - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Solving the Maximum Popular Matching Problem with Matroid Constraints. CoRR abs/2209.02195 (2022) - Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022) - 2021
- Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR abs/2107.09897 (2021) - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - 2020
- Tamás Király, Zsuzsa Mészáros-Karkus:
Finding strongly popular b-matchings in bipartite graphs. Eur. J. Comb. 88: 103105 (2020) - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184(1): 411-443 (2020) - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237 - Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178 - 2019
- Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019)
skipping 46 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-05-24 08:29 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