default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera Fischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Vera Fischer
, Meritxell Pacheco Paneque, Antoine Legrain, Reinhard Bürgy:
A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection. Eur. J. Oper. Res. 315(1): 338-353 (2024)- [j30]Vera Fischer, Corey Bacal Switzer:
Tight Eventually Different families. J. Symb. Log. 89(2): 697-723 (2024) - [c2]Vera Fischer, Antoine Legrain, David Schindl:
A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities. CPAIOR (1) 2024: 277-292 - 2023
- [j29]Vera Fischer, Corey Bacal Switzer:
The structure of κ-maximal cofinitary groups. Arch. Math. Log. 62(5-6): 641-655 (2023) - [j28]Vera Fischer, Marlene Koelbing, Wolfgang Wohofsky:
Towers, mad families, and unboundedness. Arch. Math. Log. 62(5-6): 811-830 (2023) - [j27]Vera Fischer, Marlene Koelbing, Wolfgang Wohofsky:
Correction to: Towers, mad families, and unboundedness. Arch. Math. Log. 62(7-8): 1159-1160 (2023) - [j26]Vera Fischer, Corey Bacal Switzer:
Cohen preservation and independence. Ann. Pure Appl. Log. 174(8): 103291 (2023) - [j25]Vera Fischer, Marlene Koelbing, Wolfgang Wohofsky:
Fresh function spectra. Ann. Pure Appl. Log. 174(9): 103300 (2023) - [j24]Vera Fischer, Sanne Wøhlk:
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation. Comput. Oper. Res. 160: 106393 (2023) - [j23]Jorge A. Cruz-Chapital, Vera Fischer, Osvaldo Guzmán, Jaroslav Supina:
Partition forcing and Independent families. J. Symb. Log. 88(4): 1590-1612 (2023) - [j22]Ömer Faruk Bag, Vera Fischer:
Strongly unfoldable, splitting and bounding. Math. Log. Q. 69(1): 7-14 (2023) - 2022
- [j21]Jeffrey Bergfalk, Vera Fischer, Corey Bacal Switzer:
Projective well orders and coanalytic witnesses. Ann. Pure Appl. Log. 173(8): 103135 (2022) - [j20]Vera Fischer, Saharon Shelah:
The spectrum of independence, II. Ann. Pure Appl. Log. 173(9): 103161 (2022) - [j19]Vera Fischer, Diana Carolina Montoya:
Higher Independence. J. Symb. Log. 87(4): 1606-1630 (2022) - 2021
- [j18]Vera Fischer, David Schrittesser, Thilo Weinert:
Definable MAD families and forcing axioms. Ann. Pure Appl. Log. 172(5): 102909 (2021) - [j17]Vera Fischer, Dániel T. Soukup:
More ZFC inequalities between cardinal Invariants. J. Symb. Log. 86(3): 897-912 (2021) - [c1]Meritxell Pacheco Paneque, Vera Fischer, Reinhard Bürgy:
A Facility Location Problem with Minimum Workload and Penalties for Waste Collection. OR 2021: 81-86
2010 – 2019
- 2019
- [j16]Vera Fischer, Diana Carolina Montoya:
Ideals of independence. Arch. Math. Log. 58(5-6): 767-785 (2019) - [j15]Vera Fischer, Saharon Shelah:
The spectrum of independence. Arch. Math. Log. 58(7-8): 877-884 (2019) - [j14]David Chodounský, Vera Fischer, Jan Grebík:
Free sequences in ℘(ω) / fin. Arch. Math. Log. 58(7-8): 1035-1051 (2019) - 2018
- [j13]Vera Fischer, Sy D. Friedman, Diego Alejandro Mejía, Diana Carolina Montoya:
Coherent Systems of finite Support iterations. J. Symb. Log. 83(1): 208-236 (2018) - 2017
- [j12]Andrew D. Brooke-Taylor, Vera Fischer, Sy-David Friedman, Diana Carolina Montoya:
Cardinal characteristics at κ in a small u(κ) model. Ann. Pure Appl. Log. 168(1): 37-49 (2017) - [j11]Vera Fischer, David Schrittesser, Asger Törnquist:
A Co-analytic Cohen-Indestructible Maximal cofinitary Group. J. Symb. Log. 82(2): 629-647 (2017) - 2015
- [j10]Vera Fischer:
Maximal cofinitary groups revisited. Math. Log. Q. 61(4-5): 367-379 (2015) - 2014
- [j9]Vera Fischer, Sy-David Friedman, Yurii Khomskii:
Cichoń's diagram, regularity properties and Δ13 sets of reals. Arch. Math. Log. 53(5-6): 695-729 (2014) - [j8]Vera Fischer, Sy-David Friedman, Yurii Khomskii:
Measure, category and projective wellorders. J. Log. Anal. 6 (2014) - 2013
- [j7]Vera Fischer, Sy-David Friedman, Yurii Khomskii:
Co-analytic mad families and definable wellorders. Arch. Math. Log. 52(7-8): 809-822 (2013) - [j6]Vera Fischer, Sy-David Friedman, Lyubomyr Zdomskyy:
Cardinal characteristics, projective wellorders and large continuum. Ann. Pure Appl. Log. 164(7-8): 763-770 (2013) - 2012
- [j5]Vera Fischer, Sy-David Friedman, Asger Törnquist:
Projective maximal families of orthogonal measures with large continuum. J. Log. Anal. 4 (2012) - 2011
- [j4]Vera Fischer, Sy-David Friedman, Lyubomyr Zdomskyy:
Projective wellorders and mad families with large continuum. Ann. Pure Appl. Log. 162(11): 853-862 (2011) - [j3]Jörg Brendle, Vera Fischer:
Mad families, splitting families and large continuum. J. Symb. Log. 76(1): 198-208 (2011) - 2010
- [j2]Vera Fischer, Sy-David Friedman:
Cardinal characteristics and projective wellorders. Ann. Pure Appl. Log. 161(7): 916-922 (2010) - [j1]Vera Fischer, Asger Törnquist:
A co-analytic maximal set of orthogonal measures. J. Symb. Log. 75(4): 1403-1414 (2010)
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-12-10 21:46 CET 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:
