Search results for "Minor"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
144	Ken-ichi Kawarabayashi, Bojan Mohar	Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.	STOC	2006	DBLP DOI BibTeX RDF	Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
118	Ken-ichi Kawarabayashi	Half integral packing, Erdős-Posá-property and graph minors.	SODA	2007	DBLP BibTeX RDF
105	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs
105	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.	ISAAC	2006	DBLP DOI BibTeX RDF
104	Isolde Adler, Martin Grohe, Stephan Kreutzer	Computing excluded minors.	SODA	2008	DBLP BibTeX RDF
88	Austin A. Lobo, Susan A. Vowels	Information systems at a liberal arts college: an interdisciplinary minor.	CPR	2009	DBLP DOI BibTeX RDF	information systems minor, interdisciplinary, program development, information systems education, minor, liberal arts
69	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
63	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
63	Anuj Dawar, Martin Grohe, Stephan Kreutzer	Locally Excluding a Minor.	LICS	2007	DBLP DOI BibTeX RDF
63	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.	J. ACM	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
63	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP BibTeX RDF
61	Costas Busch, Ryan LaFortune, Srikanta Tirthapura	Improved sparse covers for graphs excluding a fixed minor.	PODC	2007	DBLP DOI BibTeX RDF	minor free graph, path separator, sparse cover, planar graph, compact routing
56	Leif K. Jørgensen	Vertex Partitions of K4, 4-Minor Free Graphs.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
54	Shai Gutner	Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.	IWPEC	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel
54	Mark Stockman, Soleda Leung, John Nyland, Hazem Said	The information technology minor: filling a need in the workforce of today.	SIGITE Conference	2006	DBLP DOI BibTeX RDF	curriculum, information technology education, minor, information technology profession
49	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.	ISAAC	2002	DBLP DOI BibTeX RDF
49	Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi	Additive approximation algorithms for list-coloring minor-closed class of graphs.	SODA	2009	DBLP DOI BibTeX RDF
49	Mao Ye 0001, Yongguo Liu, Hong Wu, Qihe Liu	A few online algorithms for extracting minor generalized eigenvectors.	IJCNN	2008	DBLP DOI BibTeX RDF
48	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	Spanners in Sparse Graphs.	ICALP (1)	2008	DBLP DOI BibTeX RDF
48	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Equivalence of local treewidth and linear local treewidth and its algorithmic applications.	SODA	2004	DBLP BibTeX RDF
48	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder	Strong-diameter decompositions of minor free graphs.	SPAA	2007	DBLP DOI BibTeX RDF	minor free graphs, compact routing
48	Petr Hlinený	On Matroid Representability and Minor Problems.	MFCS	2006	DBLP DOI BibTeX RDF	Matroid representability, spike, swirl. 2000 Math subject classification: 05B35, finite field, 68Q17, 68R05, minor
42	Avner Magen, Mohammad Moharrami	Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
42	Siamak Tazari, Matthias Müller-Hannemann	A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.	WG	2008	DBLP DOI BibTeX RDF
42	Bruce A. Reed, Zhentao Li	Optimization and Recognition for K 5-minor Free Graphs in Linear Time.	LATIN	2008	DBLP DOI BibTeX RDF
42	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.	SODA	2005	DBLP BibTeX RDF
42	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi	Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.	FOCS	2005	DBLP DOI BibTeX RDF
42	Glenn S. Dardick, Linda K. Lau	Interdisciplinary minor in digital forensics, security and law.	SIGITE Conference	2005	DBLP DOI BibTeX RDF	cyberlaw, electronic evidence, curriculum, digital forensics, computer forensics, digital evidence
42	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.	APPROX	2002	DBLP DOI BibTeX RDF
42	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Bidimensional Parameters and Local Treewidth.	LATIN	2004	DBLP DOI BibTeX RDF
42	Michele Kleckner	Where writing and rhetoric meet multimedia production designing an effective, interdisciplinary capstone experience.	SIGITE Conference	2004	DBLP DOI BibTeX RDF	co-taught, multimedia, curriculum, interdisciplinary, capstone course, capstone project
41	Itai Benjamini, Oded Schramm, Asaf Shapira	Every minor-closed property of sparse graphs is testable.	STOC	2008	DBLP DOI BibTeX RDF	minor closed properties, graph algorithms, property testing
41	Karim Abed-Meraim, Ammar Chkeif, Yingbo Hua, Samir Attallah	On a Class of Orthonormal Algorithms for Principal and Minor Subspace Tracking.	J. VLSI Signal Process.	2002	DBLP DOI BibTeX RDF	orthonormality, principal & minor component analysis, subspace tracking, adaptive algorithm
40	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	Algorithmica	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
40	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	COCOON	2007	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
40	Michelangelo Grigni	Approximate TSP in Graphs with Forbidden Minors.	ICALP	2000	DBLP DOI BibTeX RDF	TSP, separator, spanner, approximation scheme, graph minor, genus
39	Arvind Gupta, Russell Impagliazzo	Computing Planar Intertwines	FOCS	1991	DBLP DOI BibTeX RDF	minor closed graph families, graph family obstructions, planar intertwines, minor ordering
35	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Catalan structures and dynamic programming in H-minor-free graphs.	SODA	2008	DBLP BibTeX RDF
35	Russel Bruhn, Steven F. Jennings	A multidisciplinary bioinformatics minor.	SIGCSE	2007	DBLP DOI BibTeX RDF	bioinformatics, computational science, curriculum issues
35	Orlando Lee, Aaron Williams	Packing Dicycle Covers in Planar Graphs with No K5-e Minor.	LATIN	2006	DBLP DOI BibTeX RDF
35	Douglas E. Carroll, Ashish Goel	Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families.	ESA	2004	DBLP DOI BibTeX RDF
35	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Finding Smallest Supertrees Under Minor Containment.	WG	1999	DBLP DOI BibTeX RDF
34	Gian Carlo Bongiovanni, C. K. Wong	Tree Search in Major/Minor Loop Magnetic Bubble Memories.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	major loops, minor loops, number of comparisons, one-sided height-balanced trees, one-sided K-height-balanced trees, record movement, Analysis of algorithms, insertion, deletion, tree search, balanced trees, magnetic bubble memories
33	Andreas Jakoby, Till Tantau	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF	logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
33	Marco A. Panduro, Carlos A. Brizuela, David Covarrubias, Claudio Lopez	A trade-off curve computation for linear antenna arrays using an evolutionary multi-objective approach.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Non-regular arrays, Minor lobes, Radiation pattern, Genetic algorithms, Multi-objective
33	Margit Kristensen, Morten Kyng, Leysia Palen	Participatory design in emergency medical service: designing for future practice.	CHI	2006	DBLP DOI BibTeX RDF	Future Lab, major incidents, medical response, minor incidents, victim as boundary object, wireless biomonitor, participatory design, emergency response, technology design
29	Wenyan Jia, Shuai Kou, Weihua Yang, Chengfu Qin	A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs.	J. Interconnect. Networks	2022	DBLP DOI BibTeX RDF
29	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
29	Laurent Beaudou, Florent Foucaud, Reza Naserasr	Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
29	Mikhail I. Ostrovskii, David Rosenthal	Metric dimensions of minor excluded graphs and minor exclusion in groups.	Int. J. Algebra Comput.	2015	DBLP DOI BibTeX RDF
29	Tingting Zhu, Baoyindureng Wu	Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
29	Christian Wulff-Nilsen	Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications	CoRR	2011	DBLP BibTeX RDF
29	Vicky Choi	Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design.	Quantum Inf. Process.	2011	DBLP DOI BibTeX RDF
29	Christian Wulff-Nilsen	Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications.	FOCS	2011	DBLP DOI BibTeX RDF
29	T. Hugh Crawford	Minor houses/minor architecture.	AI Soc.	2010	DBLP DOI BibTeX RDF
29	Vicky Choi	Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design	CoRR	2010	DBLP BibTeX RDF
29	Siamak Tazari	Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs	CoRR	2010	DBLP BibTeX RDF
29	Siamak Tazari	Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs.	MFCS	2010	DBLP DOI BibTeX RDF
29	Drago Bokal, Gasper Fijavz, David R. Wood	The Minor Crossing Number of Graphs with an Excluded Minor.	Electron. J. Comb.	2008	DBLP BibTeX RDF
29	Marko V. Jankovic, Branimir Reljin	A new minor component analysis method based on Douglas-Kung-Amari minor subspace analysis method.	IEEE Signal Process. Lett.	2005	DBLP DOI BibTeX RDF
29	Manoel Lemos, James G. Oxley	On the minor-minimal 2-connected graphs having a fixed minor.	Discret. Math.	2004	DBLP DOI BibTeX RDF
29	Manoel Lemos, James G. Oxley	On the minor-minimal 3-connected matroids having a fixed minor.	Eur. J. Comb.	2003	DBLP DOI BibTeX RDF
29	Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
29	Robert E. Bixby, Collette R. Coullard	Finding a small 3-connected minor maintaining a fixed minor and a fixed element.	Comb.	1987	DBLP DOI BibTeX RDF
28	Qian-Ping Gu, Hisao Tamaki	Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time.	ISAAC	2009	DBLP DOI BibTeX RDF	Graph algorithms, graph minors, branch-decompositions
28	Roland Badeau, Gaël Richard, Bertrand David 0002	Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
28	Da-Zheng Feng, Wei Xing Zheng 0001	An Approximate Inverse-Power Algorithm for Adaptive Extraction of Minor Subspace.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
28	Raphael Yuster, Uri Zwick	Maximum matching in graphs with an excluded minor.	SODA	2007	DBLP BibTeX RDF
28	David R. Wood, Jan Arne Telle	Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.	GD	2006	DBLP DOI BibTeX RDF
28	Ken-ichi Kawarabayashi, Bjarne Toft	Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05C83
28	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi	Compact Routing for Graphs Excluding a Fixed Minor.	DISC	2005	DBLP DOI BibTeX RDF
28	Mohammed A. Hasan	Natural gradient for minor component extraction.	ISCAS (5)	2005	DBLP DOI BibTeX RDF
28	Frank Recker	Stochastic Analysis of the Traffic Confluence at the Crossing of a Major and a Minor Road.	OR	2005	DBLP DOI BibTeX RDF	V-ergodic Markov chain, Stopping time, Traffic problems, Queuing theory, Renewal process, Poisson process
28	Bin Li 0053, Kuanquan Wang, David Zhang 0001	On-Line Signature Verification Based on PCA (Principal Component Analysis) and MCA (Minor Component Analysis).	ICBA	2004	DBLP DOI BibTeX RDF
28	Jittat Fakcharoenphol, Kunal Talwar	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
28	Jens Gustedt	Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel.	STACS	1998	DBLP DOI BibTeX RDF	parallel algorithms, graph algorithms, minimum spanning tree, graph minors
28	Ken-ichi Kawarabayashi, Bruce A. Reed	A nearly linear time algorithm for the half integral parity disjoint paths packing problem.	SODA	2009	DBLP DOI BibTeX RDF
28	Robin Thomas 0001	Kt Minors in Large t-Connected Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF
28	Ken-ichi Kawarabayashi, Bruce A. Reed	Hadwiger's conjecture is decidable.	STOC	2009	DBLP DOI BibTeX RDF	Hadwiger's conjecture, the four color theorem
28	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond	Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
28	Jen-Tzung Chien, Chuan-Wei Ting	Factor Analyzed Subspace Modeling and Selection.	IEEE Trans. Speech Audio Process.	2008	DBLP DOI BibTeX RDF
28	Jian-Xun Chen, Bingchiang Jeng, Wen-Shyong Tzou	The Impact of Data Deviation in Inferring a Biological Dynamic System.	FSKD (4)	2008	DBLP DOI BibTeX RDF
28	Erik D. Demaine	Algorithmic Graph Minors and Bidimensionality.	IWPEC	2008	DBLP DOI BibTeX RDF
26	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001	Degree-Constrained Subgraph Problems: Hardness and Approximation Results.	WAOA	2008	DBLP DOI BibTeX RDF	Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
26	Ittai Abraham, Cyril Gavoille	Object location using path separators.	PODC	2006	DBLP DOI BibTeX RDF	excluded minor, separator, compact routing
26	Jaroslav Nesetril, Patrice Ossona de Mendez	Linear time low tree-width partitions and algorithmic consequences.	STOC	2006	DBLP DOI BibTeX RDF	bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
26	Ruoming Jin, Chao Wang 0050, Dmitrii Polshakov, Srinivasan Parthasarathy 0001, Gagan Agrawal	Discovering frequent topological structures from graph datasets.	KDD	2005	DBLP DOI BibTeX RDF	frequent graph pattern, topological minor, graph mining
26	Qiang Li, Yasuo Yoshida, Nobuyuki Nakamori	A Multiscale Antidiffusion Approach for Gaussian Blurred Images.	ICIP (2)	1997	DBLP DOI BibTeX RDF	multiscale antidiffusion approach, Gaussian blurred images, diffusion equation, scale space image representation, minor noise, multiscale representation method, antidiffusion time, integration computation, image restoration, image restoration, convolution, image decomposition, computationally efficient algorithm
26	Jianqiang Zhuo, Paul W. Oman, Ramkumar V. Pichai, Sujay Sahni	Using Relative Complexity To Allocate Resources In Gray-Box Testing Of Object-Oriented Code.	IEEE METRICS	1997	DBLP DOI BibTeX RDF	gray box testing, object oriented code, software testing costs, relative complexity metric, software quality assessments, industrial C++ software subsystem, rank order, minor test areas, relative test complexity, reliability, object-oriented programming, resource allocation, maintainability, black box, white box testing, testing engineers
26	Ian Carmichael, Vassilios Tzerpos, Richard C. Holt	Design maintenance: unexpected architectural interactions (experience report).	ICSM	1995	DBLP DOI BibTeX RDF	unexpected architectural interactions, design maintenance, SoFi tool, design structure extraction, large industrial system, minor implementation decisions, extracted design, intended design recovery, software maintenance, software tools, program compilers, C code
24	Kelton Minor, Esteban Moro, Nick Obradovich	Adverse weather amplifies social media activity.	CoRR	2023	DBLP DOI BibTeX RDF
24	Sascha Minor, Vix Kemanji Ketoma, Gerrit Meixner	Test automation for augmented reality applications: a development process model and case study.	i-com	2023	DBLP DOI BibTeX RDF
24	Dorothea Koert, Mirjam Minor (eds.)	Joint Proceedings of Workshops, Tutorials and Doctoral Consortium co-located with the 45rd German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19-20, 2022.	KI (Workshops)	2023	DBLP BibTeX RDF
24	Daniel Bruneß, Matthias Bay, Christian Schulze 0003, Michael Guckert, Mirjam Minor	A Hybrid AI-Based Method for ICD Classification of Medical Documents.	ICIMTH	2023	DBLP DOI BibTeX RDF
24	Nick Kalsi, Fiona Carroll, Katarzyna Minor, Jon Platts	Smart Hospitality: Understanding the 'Green' Challenges of Hotels and How IoT-Based Sustainable Development Could be the Answer.	FICTA (1)	2023	DBLP DOI BibTeX RDF
24	Marcel Mauri, Ömer Ibrahim Erduran, Thu Pham Dieu Anh, Mirjam Minor	Integrating BDI Agents with the MATSim Traffic Simulation for Autonomous Mobility on Demand.	LWDA	2023	DBLP BibTeX RDF
24	Nathan Baum, Mark A. Minor	Identification and Control of a Soft-Robotic Bladder Towards Impedance-Style Haptic Terrain Display.	IEEE Robotics Autom. Lett.	2022	DBLP DOI BibTeX RDF
24	Zhe Leng, Mark A. Minor	The Effect of Sideslip on Jackknife Limits During Low Speed Trailer Operation.	CoRR	2022	DBLP DOI BibTeX RDF
24	Colin Pollard, Jonathan P. Aston, Mark A. Minor	Estimation of Soft Robotic Bladder Compression for Smart Helmets using IR Range Finding and Hall Effect Magnetic Sensing.	CoRR	2022	DBLP DOI BibTeX RDF
24	Nathan Baum, Mark A. Minor	Identification and Control of a Soft-Robotic Bladder Towards Impedance-Style Haptic Terrain Display.	CoRR	2022	DBLP DOI BibTeX RDF