The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "MFCS"( http://dblp.L3S.de/Venues/MFCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/mfcs

Publication years (Num. hits)
1973 (51) 1974 (44) 1975 (61) 1976 (79) 1977 (62) 1978 (52) 1979 (58) 1980 (54) 1981 (58) 1984 (58) 1986 (63) 1988 (54) 1989 (53) 1990 (63) 1991 (44) 1992 (51) 1993 (69) 1994 (55) 1995 (55) 1996 (46) 1997 (52) 1998 (83) 1999 (42) 2000 (66) 2001 (62) 2002 (54) 2003 (63) 2004 (71) 2005 (70) 2006 (70) 2007 (67) 2008 (51) 2009 (64) 2010 (62) 2011 (55) 2012 (72) 2013 (74) 2016 (91) 2017 (87) 2018 (86)
Publication types (Num. hits)
inproceedings(2432) proceedings(40)
Venues (Conferences, Journals, ...)
MFCS(2472)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 309 occurrences of 239 keywords

Results
Found 2472 publication records. Showing 2472 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Andrew Ryzhikov, Marek Szykula Finding Short Synchronizing Words for Prefix Codes. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hendrik Fichtenberger, Yadu Vasudev A Two-Sided Error Distributed Property Tester For Conductance. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dani Dorfman, Haim Kaplan, László Kozma 0002, Uri Zwick Pairing heaps: the forward variant. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jenish C. Mehta Tree Tribes and Lower Bounds for Switching Lemmas. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Donald M. Stull Results on the Dimension Spectra of Planar Lines. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger Graph Similarity and Approximate Isomorphism. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli Pricing Problems with Buyer Preselection. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier The Complexity of Finding Small Separators in Temporal Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Moore, Naomi Nishimura, Vijay Subramanya Reconfiguration of Graph Minors. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Neil Lutz, Donald M. Stull Projection Theorems Using Effective Dimension. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cedric Berenger, Peter Niebert, Kévin Perrot Balanced Connected Partitioning of Unweighted Grid Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Jakob T. Spooner Faster Exploration of Degree-Bounded Temporal Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey Shallit Lagrange's Theorem for Binary Squares. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu Double Threshold Digraphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Louisa Seelbach Benkner, Markus Lohrey Average Case Analysis of Leaf-Centric Binary Tree Sources. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi 0001, Subhash Suri Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel L. Pérez del Pozo, Ugo Vaccaro Probabilistic Secret Sharing. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann 0002 Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ran Ben-Basat, Gil Einziger, Roy Friedman Give Me Some Slack: Efficient Network Measurements. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guy Avni, Shibashis Guha, Orna Kupferman Timed Network Games with Clocks. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet The Complexity of Disjunctive Linear Diophantine Constraints. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim 0002, Michael Lampis New Results on Directed Edge Dominating Set. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey Interval-Like Graphs and Digraphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mareike Dressler, Adam Kurpisz, Timo de Wolff Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj Generalized Budgeted Submodular Set Function Maximization. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan 0001 Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Egor Klenin, Alexander Kozachinskiy One-Sided Error Communication Complexity of Gap Hamming Distance. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aris Pagourtzis, Tomasz Radzik Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bill Fefferman, Shelby Kimmel Quantum vs. Classical Proofs and Subset Verification. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Lück On the Complexity of Team Logic and Its Two-Variable Fragment. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Göbel 0001, J. A. Gregor Lagodzinski, Karen Seidel 0001 Counting Homomorphisms to Trees Modulo a Prime. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Artur Jez, Markus Lohrey Sliding Windows over Context-Free Languages. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth Maximum Area Axis-Aligned Square Packings. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stéphane Le Roux 0001 Concurrent Games and Semi-Random Determinacy. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Dixon, Aduri Pavan, N. V. Vinodchandran On Pseudodeterministic Approximation Algorithms. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lukas Fleischer, Manfred Kufleitner Testing Simon's congruence. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikhail V. Berlinkov, Robert Ferens, Marek Szykula Complexity of Preimage Problems for Deterministic Finite Automata. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa The b-Branching Problem in Digraphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Igor Potapov, Paul G. Spirakis, James Worrell 0001 (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Christian Doczkal, Damien Pous Treewidth-Two Graphs as a Free Algebra. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001 The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos Maximum Rooted Connected Expansion. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang 0001, Yuchen Zhou Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yassine Hamoudi Simultaneous Multiparty Communication Protocols for Composed Functions. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Bärtschi, Daniel Graf 0001, Matús Mihalák Collective Fast Delivery by Energy-Efficient Agents. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Konrad A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Argyrios Deligkas, Reshef Meir Directed Graph Minors and Serial-Parallel Width. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh 0001 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi On Efficiently Solvable Cases of Quantum k-SAT. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer A Subquadratic Algorithm for 3XOR. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arnaud Carayol, Matthew Hague Optimal Strategies in Pushdown Reachability Games. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akitoshi Kawamura, Holger Thies, Martin Ziegler 0001 Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Gad M. Landau, Tatiana A. Starikovskaya Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Titus Dose Balance Problems for Integer Circuits. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler Shape Recognition by a Finite Automaton Robot. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Costanza Catalano, Raphaël M. Jungers On Randomized Generation of Slowly Synchronizing Automata. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Erik Paul A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri Enumerating Minimal Transversals of Hypergraphs without Small Holes. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin Online Maximum Matching with Recourse. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Louis-Marie Dando, Sylvain Lombardy On Hadamard Series and Rotating Q-Automata. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi Spanning-Tree Games. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ralph Christian Bottesch On W[1]-Hardness as Evidence for Intractability. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kelin Luo, Thomas Erlebach, Yinfeng Xu Car-Sharing between Two Locations: Online Scheduling with Two Servers. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist Why are CSPs Based on Partition Schemes Computationally Hard?. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari Listing Subgraphs by Cartesian Decomposition. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann 0002 Team Semantics for the Specification and Verification of Hyperproperties. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Andrej Sajenko Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikhail Andreev, Gleb Posobin, Alexander Shen Plain Stopping Time and Conditional Complexities Revisited. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Kozachinskiy From Expanders to Hitting Distributions and Simulation Theorems. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang 0008 Hardness Results for Consensus-Halving. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kazuyuki Amano Depth Two Majority Circuits for Majority and List Expanders. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Léo Exibard, Emmanuel Filiot, Ismaël Jecker The Complexity of Transducer Synthesis from Multi-Sequential Specifications. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andre Droschinsky, Nils M. Kriege, Petra Mutzel Largest Weight Common Subtree Embeddings with Distance Penalties. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Florent R. Madelaine, Barnaby Martin Consistency for Counting Quantifiers. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Daniel Král Recovering Sparse Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hasan Abasi Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guillaume Burel Linking Focusing and Resolution with Selection. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Markus L. Schmid Consensus Strings with Small Maximum Distance and Small Distance Sum. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thijs Laarhoven Hypercube LSH for Approximate near Neighbors. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis Binary Search in Graphs Revisited. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius Eilenberg Theorems for Free. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Fulla, Stanislav Zivny The Complexity of Boolean Surjective General-Valued CSPs. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guy Avni, Shibashis Guha, Orna Kupferman Timed Network Games. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christoph Haase, Stefan Kiefer, Markus Lohrey Counting Problems for Parikh Images. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak A Characterisation of Pi^0_2 Regular Tree Languages. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Igor Potapov, Pavel Semukhin Membership Problem in GL(2, Z) Extended by Singular Matrices. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matthew Hague, Roland Meyer, Sebastian Muskalla Domains for Higher-Order Games. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ping Lu, Zhilin Wu, Haiming Chen The Complexity of SORE-definability Problems. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Xiaotie Deng, Yansong Gao, Jie Zhang 0008 Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Narayan Vikas Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2472 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license