István Miklós

73 papers B 1C 4Journal 63Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	#P-Hardness proofs of matrix immanants evaluated on restricted matrices. Theor. Comput. Sci. István Miklós, Cordian Riener
2025	J	`jnl`	Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences. Discret. Math. Runze Li, István Miklós
2025	J	`jnl`	Fully graphic degree sequences and P-stable degree sequences. Adv. Appl. Math. Péter L. Erdös, István Miklós, Lajos Soukup
2025	J	`jnl`	On the Complexity of Bipartite Degree Realizability. CoRR István Miklós
2024	J	`jnl`	Fully graphic degree sequences and P-stable degree sequences. CoRR Péter L. Erdös, István Miklós, Lajos Soukup
2024	J	`jnl`	Superpolynomial period lengths of the winning positions in the subtraction game. Int. J. Game Theory István Miklós, Logan Post
2023	J	`jnl`	A Markov chain on the solution space of edge colorings of bipartite graphs. Discret. Appl. Math. Letong Hong, István Miklós
2023	J	`jnl`	Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. CoRR Andras Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós
2023	J	`jnl`	Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. Discret. Appl. Math. Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth
2023	J	`jnl`	Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences. CoRR Runze Li, István Miklós
2023	J	`jnl`	Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). Dagstuhl Reports David I. Bevan, Miklós Bóna, István Miklós
2022	J	`jnl`	Approximate Sampling of Graphs with Near-P-stable Degree Intervals. CoRR Péter L. Erdös, Tamás Róbert Mezei, István Miklós
2022	J	`jnl`	The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2021	J	`jnl`	#P-hardness proofs of matrix immanants evaluated on restricted matrices. CoRR István Miklós, Cordian Riener
2021	J	`jnl`	A Markov chain on the solution space of edge-colorings of bipartite graphs. CoRR Letong Hong, István Miklós
2021	J	`jnl`	Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. CoRR Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth
2021	J	`jnl`	Edge disjoint caterpillar realizations. Discret. Appl. Math. István Miklós, Geneva Schlafly, Yuheng Wang, Zhangyang Wei
2021	J	`jnl`	Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2020	J	`jnl`	Packing Tree Degree Sequences. Graphs Comb. Aravind Gollakota, Will Hardt, István Miklós
2019	J	`jnl`	A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2019	J	`jnl`	Packing tree degree sequences. Informatica (Slovenia) Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós
2019	J	`jnl`	The computational complexity of calculating partition functions of optimal medians with Hamming distance. Adv. Appl. Math. István Miklós, Heather C. Smith
2019	J	`jnl`	The mixing time of the swap (switch) Markov chains: a unified approach. CoRR Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2018	J	`jnl`	Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). Dagstuhl Reports Michael Albert, David I. Bevan, Miklós Bóna, István Miklós
2018	J	`jnl`	New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. Comb. Probab. Comput. Péter L. Erdös, István Miklós, Zoltán Toroczkai
2017	J	`jnl`	Graph Realizations Constrained by Skeleton Graphs. Electron. J. Comb. Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós
2017	J	`jnl`	Half-regular factorizations of the complete bipartite graph. Discret. Appl. Math. Mark Aksen, István Miklós, Kathleen Zhou
2016	J	`jnl`	New classes of degree sequences with fast mixing swap Markov chain sampling. CoRR Péter L. Erdös, István Miklós, Zoltán Toroczkai
2016	J	`jnl`	Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071). Dagstuhl Reports Michael Albert, Miklós Bóna, István Miklós, Einar Steingrímsson
2016	—	`ch.`	Statistical Multiple Alignment. Encyclopedia of Algorithms István Miklós
2016	J	`jnl`	The second order degree sequence problem is NP-complete. CoRR Péter L. Erdös, István Miklós
2015	J	`jnl`	A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. SIAM J. Discret. Math. Péter L. Erdös, István Miklós, Zoltán Toroczkai
2015	J	`jnl`	Approximate statistical alignment by iterative sampling of substitution matrices. CoRR Joseph L. Herman, Adrienn Szabó, István Miklós, Jotun Hein
2015	J	`jnl`	Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs. BMC Bioinform. Joseph L. Herman, Ádám Novák, Rune B. Lyngsø, Adrienn Szabó, István Miklós, Jotun Hein
2015	J	`jnl`	Exact sampling of graphs with prescribed degree correlations. CoRR Kevin E. Bassler, Charo I. Del Genio, Péter L. Erdös, István Miklós, Zoltán Toroczkai
2015	J	`jnl`	On realizations of a joint degree matrix. Discret. Appl. Math. Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
2015	J	`jnl`	Sampling and counting genome rearrangement scenarios. BMC Bioinform. István Miklós, Heather C. Smith
2015	J	`jnl`	The computational complexity of calculating partition functions of optimal medians with Hamming distance. CoRR István Miklós, Heather C. Smith
2014	J	`jnl`	Counting and sampling SCJ small parsimony solutions. Theor. Comput. Sci. István Miklós, Sándor Z. Kiss, Eric Tannier
2014	—	`conf`	Information Extraction from Hungarian, English and German CVs for a Career Portal. MIKE Richárd Farkas, András Dobó, Zoltán Kurai, István Miklós, Ágoston Nagy, Veronika Vincze, János Zsibrita
2014	J	`jnl`	Modulated string searching. Theor. Comput. Sci. Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
2013	J	`jnl`	A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. CoRR Péter L. Erdös, István Miklós, Zoltán Toroczkai
2013	J	`jnl`	Modulated String Searching CoRR Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
2013	J	`jnl`	On Realizations of a Joint Degree Matrix CoRR Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
2013	J	`jnl`	On sampling SCJ rearrangement scenarios CoRR István Miklós, Sándor Z. Kiss, Eric Tannier
2013	J	`jnl`	On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. Péter L. Erdös, Zoltán Király, István Miklós
2013	J	`jnl`	Proving the Pressing Game Conjecture on Linear Graphs CoRR Eliot Bixby, Toby Flint, István Miklós
2013	J	`jnl`	Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. Electron. J. Comb. István Miklós, Péter L. Erdös, Lajos Soukup
2012	J	`jnl`	Approximating the number of Double Cut-and-Join scenarios. Theor. Comput. Sci. István Miklós, Eric Tannier
2012	J	`jnl`	On the swap-distances of different realizations of a graphical degree sequence CoRR Péter L. Erdös, Zoltán Király, István Miklós
2012	J	`jnl`	Positive Evolutionary Selection of an HD Motif on Alzheimer Precursor Protein Orthologues Suggests a Functional Role. PLoS Comput. Biol. István Miklós, Zoltán Zádori
2010	J	`jnl`	A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. Electron. J. Comb. Péter L. Erdös, István Miklós, Zoltán Toroczkai
2010	J	`jnl`	Bayesian sampling of genomic rearrangement scenarios via double cut and join. Bioinform. István Miklós, Eric Tannier
2010	J	`jnl`	MCMC Network: Graphical Interface for Bayesian Analysis of Metabolic Networks. ERCIM News Eszter Friedman, István Miklós, Jotun Hein
2010	J	`jnl`	Reticular Alignment: A progressive corner-cutting method for multiple sequence alignment. BMC Bioinform. Adrienn Szabó, Ádám Novák, István Miklós, Jotun Hein
2010	J	`jnl`	The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths. IEEE ACM Trans. Comput. Biol. Bioinform. István Miklós, Bence Mélykúti, Krister M. Swenson
2009	—	`ed.`	Comparative Genomics, International Workshop, RECOMB-CG 2009, Budapest, Hungary, September 27-29, 2009. Proceedings RECOMB-CG Francesca D. Ciccarelli, István Miklós
2008	J	`jnl`	How reliably can we predict the reliability of protein structure predictions? BMC Bioinform. István Miklós, Ádám Novák, Balázs Dombai, Jotun Hein
2008	J	`jnl`	StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees. Bioinform. Ádám Novák, István Miklós, Rune B. Lyngsø, Jotun Hein
2008	—	`ch.`	Statistical Multiple Alignment. Encyclopedia of Algorithms István Miklós
2007	J	`jnl`	SimulFold: Simultaneously Inferring RNA Structures Including Pseudoknots, Alignments, and Trees Using a Bayesian MCMC Framework. PLoS Comput. Biol. Irmtraud M. Meyer, István Miklós
2006	B	`conf`	A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. RECOMB Miklós Csürös, István Miklós
2006	C	`conf`	Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC. WABI István Miklós, Timothy Brooks Paige, Péter Ligeti
2005	J	`jnl`	A linear memory algorithm for Baum-Welch training CoRR István Miklós, Irmtraud M. Meyer
2005	J	`jnl`	A linear memory algorithm for Baum-Welch training. BMC Bioinform. István Miklós, Irmtraud M. Meyer
2005	J	`jnl`	Bayesian coestimation of phylogeny and sequence alignment. BMC Bioinform. Gerton Lunter, István Miklós, Alexei J. Drummond, Jens Ledet Jensen, Jotun Hein
2005	J	`jnl`	ParIS Genome Rearrangement server. Bioinform. István Miklós, Péter Ittzés, Jotun Hein
2004	—	`conf`	Genome Rearrangement in Mitochondria and Its Computational Biology. Comparative Genomics István Miklós, Jotun Hein
2003	J	`jnl`	Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution. Discret. Appl. Math. István Miklós
2003	J	`jnl`	An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees. J. Comput. Biol. Gerton Lunter, István Miklós, Yun S. Song, Jotun Hein
2003	C	`conf`	Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model. WABI Gerton Lunter, István Miklós, Alexei J. Drummond, Jens Ledet Jensen, Jotun Hein
2003	C	`conf`	MCMC genome rearrangement. ECCB István Miklós
2001	C	`conf`	An Improved Model for Statistical Alignment. WABI István Miklós, Zoltán Toroczkai