default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Wiener
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Jan Goedgebeur
, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian graphs: II. J. Graph Theory 105(4): 580-611 (2024)- 2023
- [j25]Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [i8]Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Query complexity of Boolean functions on the middle slice of the cube. CoRR abs/2309.13678 (2023) - [i7]Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian Graphs: II. CoRR abs/2311.05262 (2023) - 2021
- [j24]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j23]Gábor Wiener, Maho Yokota, Carol T. Zamfirescu:
Spiders everywhere. Discret. Appl. Math. 289: 516-522 (2021) - 2020
- [j22]Gábor Wiener, Éva Hosszu, János Tapolcai:
On separating systems with bounded set size. Discret. Appl. Math. 276: 172-176 (2020) - [j21]Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu:
On minimum leaf spanning trees and a criticality notion. Discret. Math. 343(7): 111884 (2020)
2010 – 2019
- 2019
- [j20]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. Discret. Math. 342(11): 3000-3005 (2019) - [i6]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019) - 2018
- [j19]Gábor Wiener, Carol T. Zamfirescu:
Gallai's question and constructions of almost hypotraceable graphs. Discret. Appl. Math. 243: 270-278 (2018) - [j18]Gábor Wiener:
New constructions of hypohamiltonian and hypotraceable graphs. J. Graph Theory 87(4): 526-535 (2018) - [j17]Gábor Wiener:
Depth first search in claw-free graphs. Optim. Lett. 12(2): 367-373 (2018) - [i5]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. CoRR abs/1806.04451 (2018) - 2017
- [j16]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12(2): 301-314 (2017) - [j15]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219: 18-31 (2017) - [j14]Gábor Wiener:
Leaf-Critical and Leaf-Stable Graphs. J. Graph Theory 84(4): 443-459 (2017) - 2016
- [j13]Gábor Wiener:
On constructions of hypotraceable graphs. Electron. Notes Discret. Math. 54: 127-132 (2016) - [j12]Tamás Fleiner, Gábor Wiener:
Coloring signed graphs using DFS. Optim. Lett. 10(4): 865-869 (2016) - 2015
- [j11]Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49: 345-351 (2015) - [j10]Gábor Wiener:
On non-traceable, non-hypotraceable, arachnoid graphs. Electron. Notes Discret. Math. 49: 621-627 (2015) - 2014
- [j9]Peter Damaschke, Azam Sheikh Muhammad, Gábor Wiener:
Strict group testing and the set basis problem. J. Comb. Theory A 126: 70-91 (2014) - 2013
- [j8]Gábor Wiener:
Rounds in Combinatorial Search. Algorithmica 67(3): 315-323 (2013) - [c2]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 543-556 - 2012
- [j7]Gianluca De Marco, Evangelos Kranakis, Gábor Wiener:
Computing majority with triple queries. Theor. Comput. Sci. 461: 17-26 (2012) - [i4]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-based group testing. CoRR abs/1204.1464 (2012) - [i3]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. CoRR abs/1211.3000 (2012) - 2011
- [j6]Makoto Araya, Gábor Wiener:
On Cubic Planar Hypohamiltonian and Hypotraceable Graphs. Electron. J. Comb. 18(1) (2011) - [j5]Gábor Wiener, Makoto Araya:
On planar hypohamiltonian graphs. J. Graph Theory 67(1): 55-68 (2011) - [c1]Gianluca De Marco, Evangelos Kranakis, Gábor Wiener:
Computing Majority with Triple Queries. COCOON 2011: 604-615 - [i2]Gianluca De Marco, Evangelos Kranakis, Gábor Wiener:
Computing Majority with Triple Queries. CoRR abs/1105.1622 (2011) - 2010
- [j4]Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding the maximum and minimum elements with one lie. Discret. Appl. Math. 158(9): 988-995 (2010)
2000 – 2009
- 2009
- [i1]Gábor Wiener:
Rounds in Combinatorial Search. Search Methodologies 2009 - 2008
- [j3]Gábor Salamon, Gábor Wiener:
On finding spanning trees with few leaves. Inf. Process. Lett. 105(5): 164-169 (2008) - 2007
- [j2]Gábor Wiener:
Edge Multiplicity and Other Trace Functions. Electron. Notes Discret. Math. 29: 491-495 (2007) - 2004
- [j1]Gábor Wiener:
Recognition problems and communication complexity. Discret. Appl. Math. 137(1): 109-123 (2004)
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-06-10 20:24 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:
