default search action
Tamás Schwarcz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Kristóf Bérczi
, Bence Mátravölgyi, Tamás Schwarcz:
Weighted exchange distance of basis pairs. Discret. Appl. Math. 349: 130-143 (2024) - [j6]Kristóf Bérczi
Partitioning into common independent sets via relaxing strongly base orderability. J. Comb. Theory A 202: 105817 (2024) - [j5]Kristóf Bérczi, Tamás Schwarcz
Exchange Distance of Basis Pairs in Split Matroids. SIAM J. Discret. Math. 38(1): 132-147 (2024) - [c4]Yuhang Bai
Approximating Maximum-Size Properly Colored Forests. ESA 2024: 14:1-14:18 - [c3]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-Labeled Matroid Bases. ICALP 2024: 86:1-86:20 - [c2]Kristóf Bérczi
Reconfiguration of Basis Pairs in Regular Matroids. STOC 2024: 1653-1664 - [i11]Yuhang Bai, Kristóf Bérczi, Gergely Kál Csáji, Tamás Schwarcz:
Approximating maximum-size properly colored forests. CoRR abs/2402.00834 (2024) - [i10]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-labeled Matroid Bases. CoRR abs/2402.16259 (2024) - 2023
- [j4]Kristóf Bérczi
Hypergraph characterization of split matroids. J. Comb. Theory A 194: 105697 (2023) - [c1]Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
Reconfiguration of the Union of Arborescences. ISAAC 2023: 48:1-48:14 - [i9]Kristóf Bérczi, Tamás Schwarcz:
Partitioning into common independent sets via relaxing strongly base orderability. CoRR abs/2302.01445 (2023) - [i8]Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz:
Reconfiguration of the Union of Arborescences. CoRR abs/2304.13217 (2023) - [i7]Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz:
Reconfiguration of basis pairs in regular matroids. CoRR abs/2311.07130 (2023) - 2022
- [j3]Kristóf Bérczi
Rainbow and monochromatic circuits and cocircuits in binary matroids. Discret. Math. 345(6): 112830 (2022) - [i6]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) - [i5]Kristóf Bérczi, Tamás Schwarcz:
Exchange distance of basis pairs in split matroids. CoRR abs/2203.01779 (2022) - [i4]Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz:
Weighted exchange distance of basis pairs. CoRR abs/2211.12750 (2022) - 2021
- [j2]Kristóf Bérczi
Complexity of packing common bases in matroids. Math. Program. 188(1): 1-18 (2021) - [j1]Kristóf Bérczi
List Coloring of Two Matroids through Reduction to Partition Matroids. SIAM J. Discret. Math. 35(3): 2192-2209 (2021) - 2020
- [i3]Kristóf Bérczi, Tamás Schwarcz:
Rainbow and monochromatic circuits and cuts in binary matroids. CoRR abs/2012.05037 (2020)
2010 – 2019
- 2019
- [i2]Kristóf Bérczi, Tamás Schwarcz:
Complexity of packing common bases in matroids. CoRR abs/1903.03579 (2019) - [i1]Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List colouring of two matroids through reduction to partition matroids. CoRR abs/1911.10485 (2019)
Coauthor Index
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.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: